sweirich / reboundLinks
# A simple variable binding library based on well-scoped indices and environments
☆29Updated 3 months ago
Alternatives and similar repositories for rebound
Users that are interested in rebound are comparing it to the libraries listed below
Sorting:
- being a particular fragment of Haskell, extended to a proof system☆43Updated 2 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 5 months ago
- Experimental implementation of a Cubical Type Theory modeled by presheaves over posets☆12Updated last year
- my phd thesis☆26Updated last year
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- ☆38Updated 4 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 2 weeks ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- Eventually a practical 2-level TT-based compiler☆31Updated last week
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Extensions to cubical for categorical logic/type theory☆35Updated this week
- A work-in-progress core language for Agda, in Agda☆64Updated this week
- high-performance cubical evaluation☆79Updated 9 months ago
- Mechanizations of Type Theories☆33Updated 3 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- ☆31Updated 2 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Updated 3 years ago
- ☆52Updated 5 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- A verified compiler for a lazy functional language☆39Updated last week