update lists
This commit is contained in:
56
terminal/coq
56
terminal/coq
@@ -1,4 +1,4 @@
|
||||
[38;5;12m [39m[38;2;255;187;0m[1m[4mAwesome Coq [0m[38;5;14m[1m[4m![0m[38;2;255;187;0m[1m[4mAwesome[0m[38;5;14m[1m[4m (https://awesome.re/badge.svg)[0m[38;2;255;187;0m[1m[4m (https://awesome.re)[0m
|
||||
[38;5;12m [39m[38;2;255;187;0m[1m[4mAwesome Coq [0m[38;5;14m[1m[4m![0m[38;2;255;187;0m[1m[4mAwesome[0m[38;5;14m[1m[4m (https://awesome.re/badge.svg)[0m[38;2;255;187;0m[1m[4m (https://awesome.re)[0m
|
||||
|
||||
[38;5;12m (https://github.com/coq-community/manifesto)[39m
|
||||
|
||||
@@ -27,7 +27,7 @@
|
||||
[38;5;12m - [39m[38;5;14m[1mCourse Material[0m[38;5;12m (#course-material)[39m
|
||||
[38;5;12m - [39m[38;5;14m[1mTutorials and Hints[0m[38;5;12m (#tutorials-and-hints)[39m
|
||||
|
||||
[38;5;238m――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――[39m
|
||||
[38;5;238m――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――――[39m
|
||||
|
||||
[38;2;255;187;0m[4mProjects[0m
|
||||
|
||||
@@ -55,7 +55,7 @@
|
||||
[38;5;12m- [39m[38;5;14m[1mProof General[0m[38;5;12m (https://proofgeneral.github.io) - Generic interface for proof assistants based on the extensible, customizable text editor Emacs.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCompany-Coq[0m[38;5;12m (https://github.com/cpitclaudel/company-coq) - IDE extensions for Proof General's Coq mode.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mopam-switch-mode[0m[38;5;12m (https://github.com/ProofGeneral/opam-switch-mode) - IDE extension for Proof General to locally change or reset the opam switch from a menu or using a command.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mjsCoq[0m[38;5;12m (https://github.com/ejgallego/jscoq) - Port of Coq to JavaScript, which enables running Coq projects in a browser.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mjsCoq[0m[38;5;12m (https://github.com/jscoq/jscoq) - Port of Coq to JavaScript, which enables running Coq projects in a browser.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mJupyter kernel for Coq[0m[38;5;12m (https://github.com/EugeneLoy/coq_jupyter) - Coq support for the Jupyter Notebook web environment.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mVsCoq[0m[38;5;12m (https://github.com/coq-community/vscoq) - Language server and extension for the Visual Studio Code and VSCodium editors.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mVsCoq Legacy[0m[38;5;12m (https://github.com/coq-community/vscoq/tree/vscoq1) - Backwards-compatible extension for the Visual Studio Code and VSCodium editors using Coq's legacy XML protocol.[39m
|
||||
@@ -70,6 +70,7 @@
|
||||
[38;5;12m- [39m[38;5;14m[1mCertiGraph[0m[38;5;12m (https://github.com/Salamari/CertiGraph) - Library for reasoning about directed graphs and their embedding in separation logic.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoLoR[0m[38;5;12m (https://github.com/fblanqui/color) - Library on rewriting theory, lambda-calculus and termination, with sub-libraries on common data structures extending the Coq standard library.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mcoq-haskell[0m[38;5;12m (https://github.com/jwiegley/coq-haskell) - Library smoothing the transition to Coq for Haskell users.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq-Kruskal[0m[38;5;12m (https://github.com/DmxLarchey/Coq-Kruskal) - Collection of libraries related to rose trees and Kruskal's tree theorem.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoqInterval[0m[38;5;12m (https://gitlab.inria.fr/coqinterval/interval/) - Tactics for performing proofs of inequalities on expressions of real numbers.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq record update[0m[38;5;12m (https://github.com/tchajed/coq-record-update) - Library which provides a generic way to update Coq record fields.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq-std++[0m[38;5;12m (https://gitlab.mpi-sws.org/iris/stdpp) - Extended alternative standard library for Coq.[39m
|
||||
@@ -108,10 +109,9 @@
|
||||
[38;2;255;187;0m[4mPlugins[0m
|
||||
|
||||
[38;5;12m- [39m[38;5;14m[1mAAC Tactics[0m[38;5;12m (https://github.com/coq-community/aac-tactics) - Tactics for rewriting universally quantified equations, modulo associativity and commutativity of some operator.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoinduction[0m[38;5;12m (https://github.com/damien-pous/coinduction) - Plugin for doing proofs by enhanced coinduction.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq-Elpi[0m[38;5;12m (https://github.com/LPCIC/coq-elpi) - Extension framework based on λProlog providing an extensive API to implement commands and tactics.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mWaterproof proof language[0m[38;5;12m (https://github.com/impermeable/coq-waterproof) - Plugin providing a language for writing proof scripts in a style that resembles non-mechanized mathematical proof.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mCoqHammer[0m[38;5;12m [39m[38;5;12m(https://github.com/lukaszcz/coqhammer)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mGeneral-purpose[39m[38;5;12m [39m[38;5;12mautomated[39m[38;5;12m [39m[38;5;12mreasoning[39m[38;5;12m [39m[38;5;12mhammer[39m[38;5;12m [39m[38;5;12mtool[39m[38;5;12m [39m[38;5;12mthat[39m[38;5;12m [39m[38;5;12mcombines[39m[38;5;12m [39m[38;5;12mlearning[39m[38;5;12m [39m[38;5;12mfrom[39m[38;5;12m [39m[38;5;12mprevious[39m[38;5;12m [39m[38;5;12mproofs[39m[38;5;12m [39m[38;5;12mwith[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mtranslation[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12mproblems[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mautomated[39m[38;5;12m [39m[38;5;12mprovers[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mreconstruction[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12mfound[39m[38;5;12m [39m
|
||||
[38;5;12mproofs.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoqHammer[0m[38;5;12m (https://github.com/lukaszcz/coqhammer) - General-purpose automated reasoning hammer tool that combines learning from previous proofs with the translation of problems to automated provers and the reconstruction of found proofs.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mEquations[0m[38;5;12m (https://github.com/mattam82/Coq-Equations) - Function definition package for Coq.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mGappa[0m[38;5;12m (https://gitlab.inria.fr/gappa/coq) - Tactic for discharging goals about floating-point arithmetic and round-off errors.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mHierarchy Builder[0m[38;5;12m (https://github.com/math-comp/hierarchy-builder) - Collection of commands for declaring Coq hierarchies based on packed classes.[39m
|
||||
@@ -122,9 +122,9 @@
|
||||
[38;5;12m- [39m[38;5;14m[1mParamcoq[0m[38;5;12m (https://github.com/coq-community/paramcoq) - Plugin to generate parametricity translations of Coq terms.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mQuickChick[0m[38;5;12m (https://github.com/QuickChick/QuickChick) - Plugin for randomized property-based testing.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mSMTCoq[0m[38;5;12m (https://github.com/smtcoq/smtcoq) - Tool that checks proof witnesses coming from external SAT and SMT solvers.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mTactician[0m[38;5;12m [39m[38;5;12m(https://coq-tactician.github.io)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mInteractive[39m[38;5;12m [39m[38;5;12mtool[39m[38;5;12m [39m[38;5;12mwhich[39m[38;5;12m [39m[38;5;12mlearns[39m[38;5;12m [39m[38;5;12mfrom[39m[38;5;12m [39m[38;5;12mpreviously[39m[38;5;12m [39m[38;5;12mwritten[39m[38;5;12m [39m[38;5;12mtactic[39m[38;5;12m [39m[38;5;12mscripts[39m[38;5;12m [39m[38;5;12macross[39m[38;5;12m [39m[38;5;12mall[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12minstalled[39m[38;5;12m [39m[38;5;12mCoq[39m[38;5;12m [39m[38;5;12mpackages[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12msuggests[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mnext[39m[38;5;12m [39m[38;5;12mtactic[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mbe[39m[38;5;12m [39m[38;5;12mexecuted[39m[38;5;12m [39m[38;5;12mor[39m[38;5;12m [39m[38;5;12mtries[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mautomate[39m[38;5;12m [39m[38;5;12mproof[39m[38;5;12m [39m[38;5;12msynthesis[39m[38;5;12m [39m
|
||||
[38;5;12mfully.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mTactician[0m[38;5;12m (https://coq-tactician.github.io) - Interactive tool which learns from previously written tactic scripts across all the installed Coq packages and suggests the next tactic to be executed or tries to automate proof synthesis fully.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mUnicoq[0m[38;5;12m (https://github.com/unicoq/unicoq) - Plugin that replaces the existing unification algorithm with an enhanced one.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mWaterproof proof language[0m[38;5;12m (https://github.com/impermeable/coq-waterproof) - Plugin providing a language for writing proof scripts in a style that resembles non-mechanized mathematical proof.[39m
|
||||
|
||||
[38;2;255;187;0m[4mPuzzles and Games[0m
|
||||
|
||||
@@ -139,7 +139,7 @@
|
||||
[38;2;255;187;0m[4mTools[0m
|
||||
|
||||
[38;5;12m- [39m[38;5;14m[1mAlectryon[0m[38;5;12m (https://github.com/cpitclaudel/alectryon) - Collection of tools for writing technical documents that mix Coq code and prose.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAutosubst 2[0m[38;5;12m (https://github.com/uds-psl/autosubst2) - Tool that generates Coq code for handling binders in syntax, such as for renaming and substitutions.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAutosubst-ocaml[0m[38;5;12m (https://github.com/uds-psl/autosubst-ocaml) - Tool that generates Coq code for handling binders in syntax, such as for renaming and substitutions.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCFML[0m[38;5;12m (https://gitlab.inria.fr/charguer/cfml2) - Tool for proving properties of OCaml programs in separation logic.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mcoq2html[0m[38;5;12m (https://github.com/xavierleroy/coq2html) - Alternative HTML documentation generator for Coq.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mcoqdoc[0m[38;5;12m (https://coq.inria.fr/refman/using/tools/coqdoc.html) - Standard documentation tool that generates LaTeX or HTML files from Coq code.[39m
|
||||
@@ -162,7 +162,7 @@
|
||||
[38;5;12m- [39m[38;5;14m[1mOtt[0m[38;5;12m (https://github.com/ott-lang/ott) - Tool for writing definitions of programming languages and calculi that can be translated to Coq.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mPyCoq[0m[38;5;12m (https://github.com/ejgallego/pycoq) - Set of bindings and libraries for interacting with Coq from inside Python 3.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mRoosterize[0m[38;5;12m (https://github.com/EngineeringSoftware/roosterize) - Tool for suggesting lemma names in Coq projects.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mSail[0m[38;5;12m (https://github.com/rems-project/sail) - Tool for specifying instruction set architecture semantics of processors and generating Coq definitions.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mSail[0m[38;5;12m (https://github.com/rems-project/sail) - Tool for specifying instruction set architecture (ISA) semantics of processors and generating Coq definitions.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mSerAPI[0m[38;5;12m (https://github.com/ejgallego/coq-serapi) - Tools and OCaml library for (de)serialization of Coq code to and from JSON and S-expressions.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mTrakt[0m[38;5;12m (https://github.com/ecranceMERCE/trakt) - Generic goal preprocessing tool for proof automation tactics.[39m
|
||||
|
||||
@@ -193,6 +193,7 @@
|
||||
|
||||
[38;5;12m- [39m[38;5;14m[1mCompCert[0m[38;5;12m (http://compcert.inria.fr) - High-assurance compiler for almost all of the C language (ISO C99), generating efficient code for the PowerPC, ARM, RISC-V and x86 processors.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCeramist[0m[38;5;12m (https://github.com/certichain/ceramist) - Verified hash-based approximate membership structures such as Bloom filters.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCertiCoq[0m[38;5;12m (https://github.com/CertiCoq/certicoq) - Verified compiler from Gallina, the internal language of Coq, down to CompCert's Clight language.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mFiat-Crypto[0m[38;5;12m (https://github.com/mit-plv/fiat-crypto) - Cryptographic primitive code generation.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mFunctional Algorithms Verified in SSReflect[0m[38;5;12m (https://github.com/clayrat/fav-ssr) - Purely functional verified implementations of algorithms for searching, sorting, and other fundamental problems.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mIncremental Cycles[0m[38;5;12m (https://gitlab.inria.fr/agueneau/incremental-cycles) - Verified OCaml implementation of an algorithm for incremental cycle detection in graphs.[39m
|
||||
@@ -201,6 +202,7 @@
|
||||
[38;5;12m- [39m[38;5;14m[1mlambda-rust[0m[38;5;12m (https://gitlab.mpi-sws.org/iris/lambda-rust) - Formal model of a Rust core language and type system, a logical relation for the type system, and safety proofs for some Rust libraries.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mProsa[0m[38;5;12m (https://gitlab.mpi-sws.org/RT-PROOFS/rt-proofs) - Definitions and proofs for real-time system schedulability analysis.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mRISC-V Specification in Coq[0m[38;5;12m (https://github.com/mit-plv/riscv-coq) - Definition of the RISC-V processor instruction set architecture and extensions.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mStable sort algorithms in Coq[0m[38;5;12m (https://github.com/pi8027/stablesort) - Generic and modular proofs of correctness, including stability, of mergesort functions.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mTarjan and Kosaraju[0m[38;5;12m (https://github.com/math-comp/tarjan) - Verified implementations of algorithms for topological sorting and finding strongly connected components in finite graphs.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mVélus[0m[38;5;12m (http://velus.inria.fr) - Verified compiler for a Lustre/Scade-like dataflow synchronous language.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mVerdi Raft[0m[38;5;12m (https://github.com/uwplse/verdi-raft) - Implementation of the Raft distributed consensus protocol, verified in Coq using the Verdi framework.[39m
|
||||
@@ -217,18 +219,17 @@
|
||||
[38;5;12m- [39m[38;5;14m[1mOfficial Coq Zulip chat[0m[38;5;12m (https://coq.zulipchat.com)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mOfficial Coq-Club mailing list[0m[38;5;12m (https://sympa.inria.fr/sympa/arc/coq-club)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mOfficial Coq wiki[0m[38;5;12m (https://github.com/coq/coq/wiki)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mOfficial Coq Twitter[0m[38;5;12m (https://twitter.com/CoqLang)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mOfficial Coq X/Twitter[0m[38;5;12m (https://x.com/CoqLang)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq Zulip chat archive[0m[38;5;12m (https://coq.gitlab.io/zulip-archive/)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq subreddit[0m[38;5;12m (https://www.reddit.com/r/Coq/)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq tag on Stack Overflow[0m[38;5;12m (https://stackoverflow.com/questions/tagged/coq)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq tag on Theoretical Computer Science Stack Exchange[0m[38;5;12m (https://cstheory.stackexchange.com/questions/tagged/coq)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq tag on Proof Assistants Stack Exchange[0m[38;5;12m (https://proofassistants.stackexchange.com/questions/tagged/coq)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq keyword on Zenodo[0m[38;5;12m (https://zenodo.org/search?q=keywords%3A%22Coq%22)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mcoq-community package maintenance project[0m[38;5;12m (https://github.com/coq-community/manifesto)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq-community package maintenance project[0m[38;5;12m (https://github.com/coq-community/manifesto)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mMathematical Components wiki[0m[38;5;12m (https://github.com/math-comp/math-comp/wiki)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1m100 famous theorems proved using Coq[0m[38;5;12m (https://github.com/coq-community/coq-100-theorems)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mPlanet Coq link aggregator[0m[38;5;12m (https://coq.pl-a.net)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mSherlocoq code search[0m[38;5;12m (https://sherlocoq.sirref.org)[39m
|
||||
|
||||
[38;2;255;187;0m[4mBlogs[0m
|
||||
|
||||
@@ -247,20 +248,27 @@
|
||||
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq'Art[0m[38;5;12m (https://www.labri.fr/perso/casteran/CoqArt/) - The first book dedicated to Coq.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mSoftware Foundations[0m[38;5;12m (https://softwarefoundations.cis.upenn.edu) - Series of Coq-based textbooks on logic, functional programming, and foundations of programming languages, aimed at being accessible to beginners.[39m
|
||||
[38;5;12m - [39m[38;5;14m[1mVolume 1: Logical Foundations[0m[38;5;12m (https://softwarefoundations.cis.upenn.edu/lf-current/index.html) - Introduction to functional programming, basic concepts of logic, and computer-assisted theorem proving.[39m
|
||||
[38;5;12m - [39m[38;5;14m[1mVolume 2: Programming Language Foundations[0m[38;5;12m (https://softwarefoundations.cis.upenn.edu/plf-current/index.html) - Introduction to the theory of programming languages, including operational semantics, Hoare logic, and static type systems.[39m
|
||||
[38;5;12m - [39m[38;5;14m[1mVolume 3: Verified Functional Algorithms[0m[38;5;12m (https://softwarefoundations.cis.upenn.edu/vfa-current/index.html) - Demonstration of how a variety of fundamental data structures can be specified and verified.[39m
|
||||
[38;5;12m - [39m[38;5;14m[1mVolume 4: QuickChick[0m[38;5;12m (https://softwarefoundations.cis.upenn.edu/qc-current/index.html) - Introduction to tools for combining randomized property-based testing with formal specification and proof.[39m
|
||||
[38;5;12m - [39m[38;5;14m[1mVolume 5: Verifiable C[0m[38;5;12m (https://softwarefoundations.cis.upenn.edu/vc-current/index.html) - An extended tutorial on specifying and verifying C programs using the Verified Software Toolchain.[39m
|
||||
[38;5;12m - [39m[38;5;14m[1mVolume 6: Separation Logic Foundations[0m[38;5;12m (https://softwarefoundations.cis.upenn.edu/slf-current/index.html) - An introduction to separation logic and how to build program verification tools on top of it.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCertified Programming with Dependent Types[0m[38;5;12m (http://adam.chlipala.net/cpdt/) - Textbook about practical engineering with Coq which teaches advanced practical tricks and a very specific style of proof.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mProgram[0m[38;5;14m[1m [0m[38;5;14m[1mLogics[0m[38;5;14m[1m [0m[38;5;14m[1mfor[0m[38;5;14m[1m [0m[38;5;14m[1mCertified[0m[38;5;14m[1m [0m[38;5;14m[1mCompilers[0m[38;5;12m [39m[38;5;12m(https://www.cs.princeton.edu/~appel/papers/plcc.pdf)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mBook[39m[38;5;12m [39m[38;5;12mthat[39m[38;5;12m [39m[38;5;12mexplains[39m[38;5;12m [39m[38;5;12mhow[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mconstruct[39m[38;5;12m [39m[38;5;12mprogram[39m[38;5;12m [39m[38;5;12mlogics[39m[38;5;12m [39m[38;5;12musing[39m[38;5;12m [39m[38;5;12mseparation[39m[38;5;12m [39m[38;5;12mlogic,[39m[38;5;12m [39m[38;5;12maccompanied[39m[38;5;12m [39m[38;5;12mby[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mformal[39m[38;5;12m [39m[38;5;12mmodel[39m[38;5;12m [39m[38;5;12min[39m[38;5;12m [39m[38;5;12mCoq[39m[38;5;12m [39m[38;5;12mwhich[39m[38;5;12m [39m[38;5;12mis[39m[38;5;12m [39m[38;5;12mapplied[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m
|
||||
[38;5;12mClight[39m[38;5;12m [39m[38;5;12mprogramming[39m[38;5;12m [39m[38;5;12mlanguage[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mother[39m[38;5;12m [39m[38;5;12mexamples.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mProgram[0m[38;5;14m[1m [0m[38;5;14m[1mLogics[0m[38;5;14m[1m [0m[38;5;14m[1mfor[0m[38;5;14m[1m [0m[38;5;14m[1mCertified[0m[38;5;14m[1m [0m[38;5;14m[1mCompilers[0m[38;5;12m [39m[38;5;12m(https://www.cs.princeton.edu/~appel/papers/plcc.pdf)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mBook[39m[38;5;12m [39m[38;5;12mthat[39m[38;5;12m [39m[38;5;12mexplains[39m[38;5;12m [39m[38;5;12mhow[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mconstruct[39m[38;5;12m [39m[38;5;12mprogram[39m[38;5;12m [39m[38;5;12mlogics[39m[38;5;12m [39m[38;5;12musing[39m[38;5;12m [39m[38;5;12mseparation[39m[38;5;12m [39m[38;5;12mlogic,[39m[38;5;12m [39m[38;5;12maccompanied[39m[38;5;12m [39m[38;5;12mby[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mformal[39m[38;5;12m [39m[38;5;12mmodel[39m[38;5;12m [39m[38;5;12min[39m[38;5;12m [39m[38;5;12mCoq[39m[38;5;12m [39m[38;5;12mwhich[39m[38;5;12m [39m[38;5;12mis[39m[38;5;12m [39m[38;5;12mapplied[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mClight[39m[38;5;12m [39m
|
||||
[38;5;12mprogramming[39m[38;5;12m [39m[38;5;12mlanguage[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mother[39m[38;5;12m [39m[38;5;12mexamples.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mFormal Reasoning About Programs[0m[38;5;12m (http://adam.chlipala.net/frap/) - Book that simultaneously provides a general introduction to formal logical reasoning about the correctness of programs and to using Coq for this purpose.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mPrograms[0m[38;5;14m[1m [0m[38;5;14m[1mand[0m[38;5;14m[1m [0m[38;5;14m[1mProofs[0m[38;5;12m [39m[38;5;12m(https://ilyasergey.net/pnp/)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mBook[39m[38;5;12m [39m[38;5;12mthat[39m[38;5;12m [39m[38;5;12mgives[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mbrief[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mpractically-oriented[39m[38;5;12m [39m[38;5;12mintroduction[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12minteractive[39m[38;5;12m [39m[38;5;12mproofs[39m[38;5;12m [39m[38;5;12min[39m[38;5;12m [39m[38;5;12mCoq[39m[38;5;12m [39m[38;5;12mwhich[39m[38;5;12m [39m[38;5;12memphasizes[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mcomputational[39m[38;5;12m [39m[38;5;12mnature[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12minductive[39m[38;5;12m [39m[38;5;12mreasoning[39m[38;5;12m [39m[38;5;12mabout[39m[38;5;12m [39m[38;5;12mdecidable[39m[38;5;12m [39m
|
||||
[38;5;12mpropositions[39m[38;5;12m [39m[38;5;12mvia[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12msmall[39m[38;5;12m [39m[38;5;12mset[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12mprimitives[39m[38;5;12m [39m[38;5;12mfrom[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mSSReflect[39m[38;5;12m [39m[38;5;12mproof[39m[38;5;12m [39m[38;5;12mlanguage.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mComputer Arithmetic and Formal Proofs[0m[38;5;12m (http://iste.co.uk/book.php?id=1238) - Book that describes how to formally specify and verify floating-point algorithms in Coq using the Flocq library.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mPrograms[0m[38;5;14m[1m [0m[38;5;14m[1mand[0m[38;5;14m[1m [0m[38;5;14m[1mProofs[0m[38;5;12m [39m[38;5;12m(https://ilyasergey.net/pnp/)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mBook[39m[38;5;12m [39m[38;5;12mthat[39m[38;5;12m [39m[38;5;12mgives[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mbrief[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mpractically-oriented[39m[38;5;12m [39m[38;5;12mintroduction[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12minteractive[39m[38;5;12m [39m[38;5;12mproofs[39m[38;5;12m [39m[38;5;12min[39m[38;5;12m [39m[38;5;12mCoq[39m[38;5;12m [39m[38;5;12mwhich[39m[38;5;12m [39m[38;5;12memphasizes[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mcomputational[39m[38;5;12m [39m[38;5;12mnature[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12minductive[39m[38;5;12m [39m[38;5;12mreasoning[39m[38;5;12m [39m[38;5;12mabout[39m[38;5;12m [39m[38;5;12mdecidable[39m[38;5;12m [39m[38;5;12mpropositions[39m[38;5;12m [39m[38;5;12mvia[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m
|
||||
[38;5;12msmall[39m[38;5;12m [39m[38;5;12mset[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12mprimitives[39m[38;5;12m [39m[38;5;12mfrom[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mSSReflect[39m[38;5;12m [39m[38;5;12mproof[39m[38;5;12m [39m[38;5;12mlanguage.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mComputer Arithmetic and Formal Proofs[0m[38;5;12m (https://www.sciencedirect.com/book/9781785481123/computer-arithmetic-and-formal-proofs) - Book that describes how to formally specify and verify floating-point algorithms in Coq using the Flocq library.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mThe Mathematical Components book[0m[38;5;12m (https://math-comp.github.io/mcb/) - Book oriented towards mathematically inclined users, focusing on the Mathematical Components library and the SSReflect proof language.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mModeling and Proving in Computational Type Theory[0m[38;5;12m (https://github.com/uds-psl/MPCTT) - Book covering topics in computational logic using Coq, including foundations, canonical case studies, and practical programming.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mHydras[0m[38;5;14m[1m [0m[38;5;14m[1m&[0m[38;5;14m[1m [0m[38;5;14m[1mCo.[0m[38;5;12m [39m[38;5;12m(https://github.com/coq-community/hydra-battles)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mContinuously[39m[38;5;12m [39m[38;5;12min-progress[39m[38;5;12m [39m[38;5;12mbook[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mlibrary[39m[38;5;12m [39m[38;5;12mon[39m[38;5;12m [39m[38;5;12mKirby[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mParis'[39m[38;5;12m [39m[38;5;12mhydra[39m[38;5;12m [39m[38;5;12mbattles[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mother[39m[38;5;12m [39m[38;5;12mentertaining[39m[38;5;12m [39m[38;5;12mformalized[39m[38;5;12m [39m[38;5;12mmathematics[39m[38;5;12m [39m[38;5;12min[39m[38;5;12m [39m[38;5;12mCoq,[39m[38;5;12m [39m[38;5;12mincluding[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mproof[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mGödel-Rosser[39m[38;5;12m [39m
|
||||
[38;5;12mfirst[39m[38;5;12m [39m[38;5;12mincompleteness[39m[38;5;12m [39m[38;5;12mtheorem.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mHydras[0m[38;5;14m[1m [0m[38;5;14m[1m&[0m[38;5;14m[1m [0m[38;5;14m[1mCo.[0m[38;5;12m [39m[38;5;12m(https://github.com/coq-community/hydra-battles)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mContinuously[39m[38;5;12m [39m[38;5;12min-progress[39m[38;5;12m [39m[38;5;12mbook[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mlibrary[39m[38;5;12m [39m[38;5;12mon[39m[38;5;12m [39m[38;5;12mKirby[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mParis'[39m[38;5;12m [39m[38;5;12mhydra[39m[38;5;12m [39m[38;5;12mbattles[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mother[39m[38;5;12m [39m[38;5;12mentertaining[39m[38;5;12m [39m[38;5;12mformalized[39m[38;5;12m [39m[38;5;12mmathematics[39m[38;5;12m [39m[38;5;12min[39m[38;5;12m [39m[38;5;12mCoq,[39m[38;5;12m [39m[38;5;12mincluding[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mproof[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mGödel-Rosser[39m[38;5;12m [39m[38;5;12mfirst[39m[38;5;12m [39m
|
||||
[38;5;12mincompleteness[39m[38;5;12m [39m[38;5;12mtheorem.[39m
|
||||
|
||||
[38;2;255;187;0m[4mCourse Material[0m
|
||||
|
||||
[38;5;12m- [39m[38;5;14m[1mAn Introduction to MathComp-Analysis[0m[38;5;12m (https://staff.aist.go.jp/reynald.affeldt/documents/karate-coq.pdf) - Lecture notes on getting started with the Mathematical Components library and using it for classical reasoning and real analysis.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mFoundations of Separation Logic[0m[38;5;12m (https://chargueraud.org/teach/verif/) - Introduction to using separation logic to reason about sequential imperative programs in Coq.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mFloating-Point Numbers and Formal Proof[0m[38;5;12m (https://github.com/thery/FlocqLecture) - Introductory course on Coq real numbers and floating-point numbers from the Flocq library.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mIntroduction to the Theory of Computation[0m[38;5;12m (https://gitlab.com/umb-svl/turing) - Formalization to support an undergraduate course on the theory of computation, including languages and Turing machines.[39m
|
||||
@@ -268,6 +276,8 @@
|
||||
[38;5;12m- [39m[38;5;14m[1mMathComp School[0m[38;5;12m (https://github.com/gares/math-comp-school-2022) - Coq sources for lessons and exercises that introduce the SSReflect proof language and the Mathematical Components library.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mMechanized Semantics[0m[38;5;12m (https://github.com/xavierleroy/cdf-mech-sem) - Companion Coq sources for a course on programming language semantics at Collège de France.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mProgram Logics[0m[38;5;12m (https://github.com/xavierleroy/cdf-program-logics) - Companion Coq sources for a course on program logics at Collège de France.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mProgram[0m[38;5;14m[1m [0m[38;5;14m[1mverification[0m[38;5;14m[1m [0m[38;5;14m[1mwith[0m[38;5;14m[1m [0m[38;5;14m[1mtypes[0m[38;5;14m[1m [0m[38;5;14m[1mand[0m[38;5;14m[1m [0m[38;5;14m[1mlogic[0m[38;5;12m [39m[38;5;12m(https://gitlab.science.ru.nl/program-verification/course-2023-2024)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mLectures[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mexercise[39m[38;5;12m [39m[38;5;12mmaterial[39m[38;5;12m [39m[38;5;12mfor[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mcourse[39m[38;5;12m [39m[38;5;12min[39m[38;5;12m [39m[38;5;12mprogramming[39m[38;5;12m [39m[38;5;12mlanguage[39m[38;5;12m [39m[38;5;12msemantics,[39m[38;5;12m [39m[38;5;12mtype[39m[38;5;12m [39m[38;5;12msystems[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mprogram[39m[38;5;12m [39m[38;5;12mlogics,[39m[38;5;12m [39m[38;5;12musing[39m[38;5;12m [39m[38;5;12mCoq,[39m[38;5;12m [39m[38;5;12mat[39m[38;5;12m [39m
|
||||
[38;5;12mRadboud[39m[38;5;12m [39m[38;5;12mUniversity[39m[38;5;12m [39m[38;5;12mNijmegen.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mProofs and Reliable Programming using Coq[0m[38;5;12m (https://team.inria.fr/stamp/proofs-and-reliable-programming-using-coq-2022/) - Introduction to developing and verifying programs with Coq.[39m
|
||||
|
||||
[38;2;255;187;0m[4mTutorials and Hints[0m
|
||||
@@ -275,7 +285,11 @@
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq'Art Exercises and Tutorials[0m[38;5;12m (https://github.com/coq-community/coq-art) - Coq code and exercises from the Coq'Art book, including additional tutorials.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq in a Hurry[0m[38;5;12m (http://cel.archives-ouvertes.fr/inria-00001173) - Introduction to how Coq can be used to define logical concepts and functions and reason about them.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq requirements in Common Criteria evaluations[0m[38;5;12m (https://inria.hal.science/hal-04452421) - Guide on how to write readable and reviewable Coq code in high assurance applications.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoq Tactics in Plain English[0m[38;5;12m (https://charlesaverill.github.io/ctpe/) - Guide to Coq tactics with explanations and examples.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mLearn X in Y minutes where X=Coq[0m[38;5;12m (https://learnxinyminutes.com/docs/coq/) - Whirlwind tour of Coq as a language.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mLemma Overloading[0m[38;5;12m (https://github.com/coq-community/lemma-overloading) - Demonstration of design patterns for programming and proving with canonical structures.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mMathComp Tutorial Materials[0m[38;5;12m (https://github.com/math-comp/tutorial_material) - Source code for Mathematical Components tutorials.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mMike Nahas's Coq Tutorial[0m[38;5;12m (https://mdnahas.github.io/doc/nahas_tutorial.html) - Basics of using Coq to write formal proofs.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mTricks in Coq[0m[38;5;12m (https://github.com/tchajed/coq-tricks) - Tips, tricks, and features that are hard to discover.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mTricks in Coq[0m[38;5;12m (https://github.com/coq-community/coq-tricks) - Tips, tricks, and features in Coq that are hard to discover.[39m
|
||||
|
||||
[38;5;12mcoq Github: https://github.com/coq-community/awesome-coq[39m
|
||||
|
||||
Reference in New Issue
Block a user