wenkokke / msla2014Links
wherein I implement several substructural logics in Agda
☆24Updated 6 years ago
Alternatives and similar repositories for msla2014
Users that are interested in msla2014 are comparing it to the libraries listed below
Sorting:
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Mtac in Agda☆28Updated 4 years ago
- NbE course @ Chalmers☆28Updated 10 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- ☆16Updated 3 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- Where my everyday research happens☆54Updated last month
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 weeks ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last week
- ☆19Updated 11 months ago
- ☆31Updated 10 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- A library for doing generic programming in Agda☆32Updated 4 years ago
- ☆45Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- ☆27Updated 5 years ago