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 6 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 2 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- Specification of Agda.☆25Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Mtac in Agda☆28Updated 4 years ago
- Collaborative work on reversible computing☆18Updated 3 years ago