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:
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 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
- An enhanced unification algorithm for Coq☆58Updated last month
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 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
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- IO using sized types and copatterns☆36Updated 4 years 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
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 4 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months ago
- Work in progress☆38Updated 6 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 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
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A cost-aware logical framework, embedded in Agda.☆69Updated last month
- ☆36Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 5 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆85Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago