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:
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- An enhanced unification algorithm for Coq☆58Updated 7 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Mtac in Agda☆28Updated 4 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆36Updated 4 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 4 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Collaborative work on reversible computing☆18Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 11 months ago
- Specification of Agda.☆25Updated 6 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- secret project☆17Updated 7 years ago