# A simple variable binding library based on well-scoped indices and environments
☆29Oct 15, 2025Updated 4 months ago
Alternatives and similar repositories for rebound
Users that are interested in rebound are comparing it to the libraries listed below
Sorting:
- Compiler backend for generating Scheme code☆28Nov 27, 2025Updated 3 months ago
- Meta-programming utilities for Agda.☆20Aug 5, 2025Updated 6 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 8 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Apr 15, 2021Updated 4 years ago
- Matita (proof assistant) with embedded elpi☆15Jan 30, 2018Updated 8 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆33Feb 8, 2026Updated 3 weeks ago
- Mechanizations of Type Theories☆35Jan 15, 2026Updated last month
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- A formal consistency proof of Quine's set theory New Foundations☆79Updated this week
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- Haskell's IO simulator which closely follows core packages (base, async, stm).☆52Feb 23, 2026Updated last week
- high-performance cubical evaluation☆79Apr 27, 2025Updated 10 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Sep 21, 2022Updated 3 years ago
- ☆12May 9, 2015Updated 10 years ago
- Practical type inference for arbitrary-rank types☆11May 25, 2019Updated 6 years ago
- A portable and extensible Common Lisp LOOP implementation☆20Dec 18, 2025Updated 2 months ago
- Various mechanized proof files for fun.☆13Aug 11, 2025Updated 6 months ago
- Formalizing nbe in agda☆32Nov 22, 2012Updated 13 years ago
- A reflection-based proof tactic for lattices in Coq☆21Oct 15, 2023Updated 2 years ago
- CS410 "Advanced Functional Programming"☆30Updated this week
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago
- An implementation of "A Typed, Algebraic Approach to Parsing"☆11Mar 21, 2022Updated 3 years ago
- OCaml implementation of DSub, a ML like language with subtyping and path dependent types.☆13Apr 18, 2017Updated 8 years ago
- ☆21Apr 15, 2018Updated 7 years ago
- ☆14Nov 4, 2025Updated 4 months ago
- Formalization of CBPV extended with effect and coeffect tracking☆14Aug 30, 2024Updated last year
- An agda2hs-compatible library for well-scoped syntax☆11Nov 6, 2025Updated 3 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- Haskell bindings to Rust's regex library☆19Mar 24, 2025Updated 11 months ago
- Logical relation for predicative CC omega with booleans and an intensional identity type☆12Apr 22, 2025Updated 10 months ago
- JNumberTools is an open-source Java library for solving complex problems in combinatorics and number theory. Whether you're a researcher,…☆12May 13, 2025Updated 9 months ago
- A work-in-progress core language for Agda, in Agda☆65Updated this week
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- A metalanguage for creating sophisticated DSLs in Racket.☆40Oct 14, 2025Updated 4 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆37Mar 17, 2025Updated 11 months ago
- A simple induction and BMC engine.☆24May 16, 2022Updated 3 years ago
- haha I'm graduating☆14Jul 22, 2021Updated 4 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Jan 23, 2024Updated 2 years ago
- Haskell counters that can be safely incremented from multiple threads☆19Oct 7, 2025Updated 4 months ago