plum-umd / cgcLinks
Constructive Galois connections
☆32Updated 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 7 months ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Work in progress☆37Updated last month
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 9 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 weeks ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- ☆29Updated 2 years ago
- Mtac in Agda☆28Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 8 months ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆26Updated last week
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago