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☆46Updated 11 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
- 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
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- Work in progress☆38Updated 5 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- An enhanced unification algorithm for Coq☆58Updated 7 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 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
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 3 months ago
- Formalizing nbe in agda☆32Updated 12 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Miller/pattern unification in Agda☆67Updated 2 weeks ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated last week
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 7 months ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Relation algebra library for Coq☆48Updated last month
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago