plum-umd / cgcLinks
Constructive Galois connections
☆34Updated 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 8 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
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Work in progress☆37Updated last month
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A cost-aware logical framework, embedded in Agda.☆64Updated last week
- Unification and type inference algorithms☆125Updated 10 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Denotational semantics based on graph and filter models☆23Updated 7 months ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago