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:
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
 - ☆45Updated 6 years ago
 - Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
 - The multimode presheaf proof-assistant☆36Updated 2 years ago
 - A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
 - Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
 - Where my everyday research happens☆55Updated 3 weeks ago
 - Agda formalisation of NbE for λ□☆18Updated 7 years ago
 - Proof automation – for Agda, in Agda.☆44Updated 5 years ago
 - A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
 - An approach to higher algebra in type theory☆22Updated 5 years ago
 - being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
 - NbE course @ Chalmers☆28Updated last year
 - Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
 - being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
 - Agda bindings to SMT-LIB2 compatible solvers.☆102Updated 2 months ago
 - Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
 - The Evolution of a Typechecker☆54Updated 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
 - A library for doing generic programming in Agda☆34Updated 4 years ago
 - wherein I implement several substructural logics in Agda☆24Updated 7 years ago
 - being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
 - ☆20Updated last year
 - Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
 - The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
 - Formalizing nbe in agda☆32Updated 12 years ago
 - A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
 - Implementing grep in Agda☆33Updated 4 years ago
 - ☆31Updated 11 years ago