VictorTaelin / Interaction-Type-TheoryView external linksLinks
☆120Feb 1, 2024Updated 2 years ago
Alternatives and similar repositories for Interaction-Type-Theory
Users that are interested in Interaction-Type-Theory are comparing it to the libraries listed below
Sorting:
- A minimal proof checker.☆79Sep 9, 2024Updated last year
- A programming language and model of computation that matches the optimal λ-calculus reduction algorithm perfectly.☆931Nov 13, 2025Updated 3 months ago
- Collection of Kind2 programs and proofs☆12May 17, 2024Updated last year
- ☆494Jun 11, 2024Updated last year
- Animation of Yves Lafont's Interaction Combinators☆23Jan 30, 2022Updated 4 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆84Feb 17, 2017Updated 8 years ago
- 🪆 A Staged Type Theory☆35Sep 4, 2023Updated 2 years ago
- Inpla: Interaction nets as a programming language (the current version)☆320Jan 11, 2026Updated last month
- my personal lang☆17Dec 31, 2023Updated 2 years ago
- Algebraic proof discovery in Agda☆35Dec 6, 2021Updated 4 years ago
- A proof assistant for higher-dimensional type theory☆235Jan 26, 2026Updated 2 weeks ago
- An interaction combinator runtime☆18Sep 23, 2024Updated last year
- AACMM's generic-syntax, but with QTT-style annotations☆21Apr 7, 2024Updated last year
- Implementations of algebraic rewriting techniques like DPO, SPO, SqPO.☆35Oct 4, 2025Updated 4 months ago
- Small TS library to type and safely handle `serde` JSON serializations of Rust enums.☆11Nov 14, 2024Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆32Jan 11, 2022Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Nov 21, 2025Updated 2 months ago
- ☆23Jul 1, 2024Updated last year
- An LLVM interface for Lean 4. (WIP)☆26Aug 1, 2023Updated 2 years ago
- 🧪 | LLVM backend for HVM☆23May 23, 2023Updated 2 years ago
- Category theory formalized in cubical agda☆21Feb 16, 2020Updated 6 years ago
- 🧊 Модальний гомотопічний верифікатор математики☆24May 30, 2025Updated 8 months ago
- Graded Dependent Type systems☆25Jun 28, 2023Updated 2 years ago
- A Lévy-optimal lambda calculus reducer with a backdoor to C☆43Feb 8, 2026Updated last week
- Agda category theory library for denotational design☆57Jan 25, 2026Updated 3 weeks ago
- ☆12May 7, 2023Updated 2 years ago
- A modern supercompiler for call-by-value functional languages☆466Dec 5, 2025Updated 2 months ago
- A modern proof language☆3,719Jan 22, 2025Updated last year
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Apr 22, 2022Updated 3 years ago
- Formalization of type theory☆22Jul 5, 2021Updated 4 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆74Feb 1, 2026Updated 2 weeks ago
- The Simplest Parser Library (that works) in Rust☆44Aug 6, 2024Updated last year
- Staged compilation with dependent types☆187Feb 1, 2026Updated 2 weeks ago
- Par (⅋) is an experimental concurrent programming language. It's an attempt to bring the expressive power of linear logic into practice.☆680Updated this week
- an experimental new programming language based on interaction nets☆338Updated this week
- A formalization of the theory behind the mugen library☆19Jun 24, 2024Updated last year
- cadCAD implementation in Julia☆17Dec 13, 2024Updated last year
- A type theory for tiny objects☆19Dec 12, 2023Updated 2 years ago
- ☆15Aug 27, 2025Updated 5 months ago