plum-umd / cgcLinks
Constructive Galois connections
☆36Updated 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☆46Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 4 months ago
- An enhanced unification algorithm for Coq☆58Updated this week
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Formalizing nbe in agda☆32Updated 13 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 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 showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last week
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Relation algebra library for Coq☆48Updated 2 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Miller/pattern unification in Agda☆67Updated last month
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆97Updated last week
- Work in progress☆38Updated 5 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago