AndrasKovacs / setoidttLinks
Prototype implementations of systems based on setoid type theory
☆66Updated 5 years ago
Alternatives and similar repositories for setoidtt
Users that are interested in setoidtt are comparing it to the libraries listed below
Sorting:
- ☆51Updated 5 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Where my everyday research happens☆55Updated 3 weeks ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 6 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- NbE course @ Chalmers☆28Updated last year
- Eventually a practical 2-level TT-based compiler☆31Updated this week
- The multimode presheaf proof-assistant☆37Updated last week
- A library for doing generic programming in Agda☆36Updated 5 years ago
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- ☆31Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A TACtic library for Agda☆51Updated last year
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- A formalized proof of a version of the initiality conjecture☆45Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated last week
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Staged push/pull fusion with typed Template Haskell☆62Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated last week
- ☆25Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 5 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- ICFP tutorial☆39Updated 4 years ago
- Reimplementation of Parsley in Haskell, with improvements☆60Updated 2 months ago
- Generic functions for single-sorted first-order structural unification☆45Updated 9 months ago