pleiad / RefinementsLinks
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:
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 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
- Mtac in Agda☆28Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 6 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Session types in Idris2!☆27Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- secret project☆17Updated 7 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 8 months ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- ☆23Updated 11 months ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated last year
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago