AndrasKovacs / setoidtt
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
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- ☆47Updated last month
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- Where my everyday research happens☆52Updated last week
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- Implementation for ICFP 2020 paper☆49Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 5 months ago
- ICFP tutorial☆39Updated 3 years ago
- The multimode presheaf proof-assistant☆36Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆81Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆45Updated 5 months ago
- Eventually a practical 2-level TT-based compiler☆26Updated last week
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆61Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆56Updated 7 months ago
- Unification and type inference algorithms☆124Updated 9 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- NbE course @ Chalmers☆28Updated 3 months ago
- ☆27Updated last year
- A tutorial on how Agda infers things☆38Updated 4 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 9 months ago
- Setoid type theory implementation☆38Updated last year
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Learn the Agda basics in three 2-hour sessions.☆57Updated last year
- A TACtic library for Agda☆48Updated 4 months ago
- Staged push/pull fusion with typed Template Haskell☆57Updated last year
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago