jwiegley / coq-latticeLinks
A reflection-based proof tactic for lattices in Coq
☆21Updated 2 years ago
Alternatives and similar repositories for coq-lattice
Users that are interested in coq-lattice are comparing it to the libraries listed below
Sorting:
- Relation algebra library for Coq☆49Updated last month
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated last year
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Updated 6 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- Class instances for Coq inductive types with little boilerplate☆27Updated last week
- Library for Classical Coq☆40Updated 7 months ago
- Revised Omega-categorical Typechecker☆27Updated last year
- A fornalisation of Grobner basis in ssreflect☆12Updated last month
- 👹 A library for hierarchical names and lexical scoping☆26Updated last month
- ☆14Updated 9 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- ☆17Updated 7 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- A proof of Abel-Ruffini theorem.☆30Updated 2 months ago
- IO for Gallina☆33Updated 3 weeks ago
- ☆18Updated last month
- Mtac in Agda☆29Updated 4 years ago
- ☆18Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago