plum-umd / cgc
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
- Work in progress☆34Updated 5 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Haskell implementation of the Edinburgh Logical Framework☆27Updated this week
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Implementing grep in Agda☆32Updated 4 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 5 months ago
- Mtac in Agda☆28Updated 4 years ago
- NbE course @ Chalmers☆28Updated 7 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Observational Type Theory as an Agda library☆53Updated 7 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- being bits and pieces I'm inclined to leave lying around☆50Updated 4 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Mechanizations of Type Theories☆28Updated 2 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- ☆21Updated 3 years ago