gmalecha / template-coq
Reflection library for Coq
☆12Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for template-coq
- A framework for extensible, reflective decision procedures.☆19Updated 4 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Constructive Galois connections☆32Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆45Updated 2 months ago
- Relation algebra library for Coq☆48Updated last week
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- Foundational Verification of Hybrid Systems☆15Updated 7 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆14Updated 3 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆15Updated last month
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]☆26Updated last week
- Domain theory and denotational semantics in Coq☆10Updated 9 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 3 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Example Coq plugin☆16Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Work in progress☆34Updated 4 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆18Updated 6 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago