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
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆56Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- ☆47Updated 5 months ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆51Updated 9 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Where my everyday research happens☆52Updated this week
- A library for doing generic programming in Agda☆31Updated 4 years ago
- ICFP tutorial☆39Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 4 months ago
- ☆23Updated 10 months ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 4 years ago
- NbE course @ Chalmers☆28Updated 7 months ago
- A TACtic library for Agda☆48Updated 7 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Paper and talk☆54Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month