gmalecha / template-coq
Reflection library for Coq
☆12Updated 5 years ago
Alternatives and similar repositories for template-coq:
Users that are interested in template-coq are comparing it to the libraries listed below
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- A framework for extensible, reflective decision procedures.☆19Updated 5 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- Bedrock Bit Vector Library☆27Updated 11 months ago
- Formalisation of Goedel's System T in Coq☆15Updated 13 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Mtac in Agda☆28Updated 3 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- Relation algebra library for Coq☆48Updated 2 weeks ago
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆32Updated 2 years ago
- Library of Unix effects for Coq.☆23Updated 5 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆15Updated 4 months ago
- ☆16Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 6 months ago
- being the programs and code for a paper about general recursion☆24Updated 10 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 2 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- The multimode presheaf proof-assistant☆36Updated last year
- Category theory and algebra☆28Updated 8 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated last year
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago