plum-umd / cgcLinks
Constructive Galois connections
☆35Updated 7 years ago
Alternatives and similar repositories for cgc
Users that are interested in cgc are comparing it to the libraries listed below
Sorting:
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- An enhanced unification algorithm for Coq☆56Updated 4 months ago
- Self-contained repository for the eponymous paper☆30Updated 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.☆22Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- Work in progress☆37Updated 2 months ago
- ☆36Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 3 weeks ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Relation algebra library for Coq☆49Updated 4 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- IO using sized types and copatterns☆35Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- A cost-aware logical framework, embedded in Agda.☆64Updated this week
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- An equational theorem prover based on Knuth-Bendix completion☆53Updated last month