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☆54Updated 4 years ago
- Where my everyday research happens☆55Updated 3 months ago
- ☆48Updated last month
- Eventually a practical 2-level TT-based compiler☆27Updated this week
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- NbE course @ Chalmers☆28Updated last year
- Staged push/pull fusion with typed Template Haskell☆62Updated last year
- ☆30Updated 2 years ago
- A TACtic library for Agda☆49Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- ICFP tutorial☆39Updated 4 years ago
- ☆23Updated last year
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Reimplementation of Parsley in Haskell, with improvements☆58Updated last year
- A prototypical dependently typed languages with sized types and variances☆111Updated 2 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- experimenting with unlifted classes via backpack☆36Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago