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 3 weeks ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Updated 6 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- A proof of Abel-Ruffini theorem.☆30Updated 2 months ago
- A fornalisation of Grobner basis in ssreflect☆12Updated last month
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated last year
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 6 years ago
- 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
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Partial Commutative Monoids☆32Updated 6 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Library for Classical Coq☆40Updated 7 months ago
- ☆14Updated 9 years ago
- ☆13Updated 6 years ago
- ☆18Updated 3 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 8 months ago