anuyts / menkarLinks
The multimode presheaf proof-assistant
☆37Updated 2 weeks ago
Alternatives and similar repositories for menkar
Users that are interested in menkar are comparing it to the libraries listed below
Sorting:
- ☆31Updated 2 years ago
- NbE course @ Chalmers☆28Updated last year
- A formalized proof of a version of the initiality conjecture☆45Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 7 years ago
- ☆23Updated last year
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- An approach to higher algebra in type theory☆23Updated 5 years ago
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- ☆16Updated 4 years ago
- A library for doing generic programming in Agda☆36Updated 5 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- define ZF Set Theory in Agda and it's model on Ordinal and Ordinal Definable Set☆14Updated 2 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Agda formalisation of NbE for λ□☆18Updated 8 years ago
- Linear Logic for Constructive Mathematics, in Agda☆18Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Agda programming with holes☆28Updated 5 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Mtac in Agda☆29Updated 4 years ago
- ☆29Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated last month
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- ☆25Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- ☆45Updated 6 years ago