pleiad / Refinements
Experiments in formalizing refinement type systems in Coq
☆17Updated 8 years ago
Related projects ⓘ
Alternatives and complementary repositories for Refinements
- a version of the 2048 game for Coq☆22Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 11 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Session types in Idris2!☆27Updated 3 years ago
- Mtac in Agda☆28Updated 3 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated last month
- Quasi-quoting library for agda☆17Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- ModTT in Agda☆11Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- Congruence Closure Procedure in Cubical Agda☆16Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 7 months ago
- System F in coq.☆19Updated 9 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 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
- Correctness of normalization-by-evaluation for STLC☆21Updated 5 years ago
- ☆21Updated 4 months ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 3 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago