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 10 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 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
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 7 months ago
- Miller/pattern unification in Agda☆68Updated 11 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 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 version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated last week
- Work in progress☆38Updated 4 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 3 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Where my everyday research happens☆55Updated 2 weeks ago
- The Evolution of a Typechecker☆54Updated 6 years ago