pleiad / RefinementsLinks
Experiments in formalizing refinement type systems in Coq
☆18Updated 10 years ago
Alternatives and similar repositories for Refinements
Users that are interested in Refinements are comparing it to the libraries listed below
Sorting:
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Constructive Galois connections☆36Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- An enhanced unification algorithm for Coq☆58Updated last week
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 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
- Haskell implementation of the Edinburgh Logical Framework☆32Updated 3 weeks ago
- Luck -- A Language for Property-Based Generators☆36Updated 11 months ago
- Specification of Agda.☆25Updated 7 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- xmonad in Coq☆46Updated 13 years ago
- secret project☆17Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago