bch29 / agda-holesLinks
Agda programming with holes
☆28Updated 4 years ago
Alternatives and similar repositories for agda-holes
Users that are interested in agda-holes are comparing it to the libraries listed below
Sorting:
- ☆45Updated 6 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- The multimode presheaf proof-assistant☆37Updated last week
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Agda formalisation of NbE for λ□☆18Updated 8 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- A formalized proof of a version of the initiality conjecture☆45Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- An approach to higher algebra in type theory☆23Updated 5 years ago
- NbE course @ Chalmers☆28Updated last year
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- Where my everyday research happens☆55Updated 2 weeks ago
- ☆20Updated last year
- ☆31Updated 2 years ago
- Linear Logic for Constructive Mathematics, in Agda☆18Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- A library for doing generic programming in Agda☆36Updated 5 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated last year
- being the materials for Summer 2013's course☆113Updated 2 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 5 months ago