wenkokke / AutoInAgda
Proof automation – for Agda, in Agda.
☆44Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for AutoInAgda
- ☆82Updated 7 years ago
- Where my everyday research happens☆53Updated last week
- Agda programming with holes☆26Updated 3 years ago
- ☆45Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- This is the place where (more or less) stable releases of my RW library will be published.☆16Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- The multimode presheaf proof-assistant☆36Updated last year
- being the materials for Summer 2013's course☆110Updated last year
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- ☆21Updated 4 months ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- Logical relations proof in Agda☆24Updated 9 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆70Updated 2 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 7 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- ☆30Updated 10 years ago
- ☆47Updated last month
- Summer school on programming in Agda☆68Updated last year
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Formal Topology in Univalent Foundations (WIP).☆35Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago