sweirich / reboundLinks
# A simple variable binding library based on well-scoped indices and environments
☆14Updated last week
Alternatives and similar repositories for rebound
Users that are interested in rebound are comparing it to the libraries listed below
Sorting:
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago
- ☆29Updated 2 years ago
- being a particular fragment of Haskell, extended to a proof system☆33Updated last week
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 3 months ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Quasi-quoting library for agda☆18Updated 8 months ago
- A style guide for Coq☆18Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Mechanizations of Type Theories☆31Updated last month
- ♾️ A library for universe levels and universe polymorphism☆34Updated 8 months ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- my phd thesis☆26Updated last year
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- Eventually a practical 2-level TT-based compiler☆27Updated last week
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- ☆16Updated last month
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆48Updated 2 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago