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:
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Constructive Galois connections☆36Updated 7 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
- An enhanced unification algorithm for Coq☆58Updated last week
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Luck -- A Language for Property-Based Generators☆36Updated 11 months ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated last month
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 8 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆87Updated 5 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Specification of Agda.☆25Updated 7 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 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago