bch29 / agda-holesLinks
Agda programming with holes
☆27Updated 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 5 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- An approach to higher algebra in type theory☆23Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Where my everyday research happens☆53Updated last month
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 9 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Literature review of GHC's Core language, System FC☆67Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Work in progress☆34Updated this week
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆98Updated 7 months ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- NbE course @ Chalmers☆28Updated 8 months ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- being the materials for Summer 2013's course☆112Updated 2 years ago