AndrasKovacs / setoidttLinks
Prototype implementations of systems based on setoid type theory
☆65Updated 4 years ago
Alternatives and similar repositories for setoidtt
Users that are interested in setoidtt are comparing it to the libraries listed below
Sorting:
- Implementation for ICFP 2020 paper☆53Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- ☆47Updated 3 weeks ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Where my everyday research happens☆53Updated last week
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 10 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- ☆23Updated 11 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Eventually a practical 2-level TT-based compiler☆27Updated 2 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- ICFP tutorial☆39Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A TACtic library for Agda☆48Updated 9 months ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- NbE course @ Chalmers☆28Updated 8 months ago
- A tutorial on how Agda infers things☆42Updated 4 years ago
- ☆29Updated 2 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- ☆45Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago