pleiad / Refinements
Experiments in formalizing refinement type systems in Coq
☆18Updated 9 years ago
Alternatives and similar repositories for Refinements
Users that are interested in Refinements are comparing it to the libraries listed below
Sorting:
- Mtac in Agda☆28Updated 4 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 7 months ago
- a version of the 2048 game for Coq☆22Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- secret project☆17Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated this week
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 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
- An enhanced unification algorithm for Coq☆56Updated last month
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 2 weeks ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- my phd thesis☆26Updated 9 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated 2 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- ☆11Updated 4 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
- Implementation of Nuprl's type theory in Coq☆45Updated 5 months ago
- Formalizations of strong normalization proofs☆35Updated 5 years ago
- ☆18Updated 3 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