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 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated last week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 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
- IO using sized types and copatterns☆36Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- Miller/pattern unification in Agda☆66Updated 2 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
- Work in progress☆39Updated 7 months ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 6 months 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
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- A small implementation of a proof refinement logic.☆50Updated 8 years 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
- Unification and type inference algorithms☆127Updated 10 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆44Updated last week
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago