sweirich / reboundLinks
# A simple variable binding library based on well-scoped indices and environments
☆17Updated 2 weeks ago
Alternatives and similar repositories for rebound
Users that are interested in rebound are comparing it to the libraries listed below
Sorting:
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 3 weeks ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆31Updated last year
- ☆36Updated 3 years ago
- An enhanced unification algorithm for Coq☆56Updated 4 months ago
- ☆48Updated 2 weeks ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- Anders: Cubical Type Checker☆23Updated last year
- ☆17Updated last year
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- A style guide for Coq☆18Updated 3 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 3 weeks ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 11 months ago
- Mechanizations of Type Theories☆32Updated 3 weeks ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 months ago
- A verified compiler for a lazy functional language☆37Updated last week
- Quasi-quoting library for agda☆18Updated 9 months ago
- 🪆 A Staged Type Theory☆35Updated last year
- Formalizations of Gradually Typed Languages in Agda☆57Updated 6 months ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated last month
- A formalization of the theory behind the mugen library☆19Updated last year
- Spartan implementation of H.O.T.T.☆25Updated 3 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year