pleiad / Refinements
Experiments in formalizing refinement type systems in Coq
☆17Updated 9 years ago
Alternatives and similar repositories for Refinements:
Users that are interested in Refinements are comparing it to the libraries listed below
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- a version of the 2048 game for Coq☆22Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Mtac in Agda☆28Updated 3 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 7 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Benchmarking tool for compile-time performance of Agda programs☆18Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- my phd thesis☆26Updated 8 months ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 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 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 weeks ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Specification of Agda.☆25Updated 6 years ago