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☆55Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 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
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- An enhanced unification algorithm for Coq☆58Updated last month
- IO using sized types and copatterns☆36Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- Mtac in Agda☆29Updated 4 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 12 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 5 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 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
- 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
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- System F in coq.☆19Updated 10 years ago