A minimal proof checker.
☆80Sep 9, 2024Updated last year
Alternatives and similar repositories for interaction-calculus-of-constructions
Users that are interested in interaction-calculus-of-constructions are comparing it to the libraries listed below
Sorting:
- ☆121Feb 1, 2024Updated 2 years ago
- my personal lang☆18Dec 31, 2023Updated 2 years ago
- Animation of Yves Lafont's Interaction Combinators☆23Jan 30, 2022Updated 4 years ago
- Collection of Kind2 programs and proofs☆12May 17, 2024Updated last year
- A programming language and model of computation that matches the optimal λ-calculus reduction algorithm perfectly.☆934Nov 13, 2025Updated 3 months ago
- A Lévy-optimal lambda calculus reducer with a backdoor to C☆43Feb 25, 2026Updated last week
- Meta-programming utilities for Agda.☆20Aug 5, 2025Updated 7 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆85Feb 17, 2017Updated 9 years ago
- A minimal pure functional language based on self dependent types.☆73May 11, 2022Updated 3 years ago
- An interaction combinator runtime☆18Sep 23, 2024Updated last year
- An implementation of interaction nets as a forth-like language.☆45Nov 16, 2025Updated 3 months ago
- Inpla: Interaction nets as a programming language (the current version)☆325Feb 28, 2026Updated last week
- Agda to C compiler☆10Sep 23, 2025Updated 5 months ago
- ☆495Jun 11, 2024Updated last year
- An efficient, secure cryptocomputer☆614Nov 25, 2023Updated 2 years ago
- HVM3☆278Jan 29, 2026Updated last month
- A massively parallel, optimal functional runtime in Rust☆31Aug 7, 2024Updated last year
- MnemOS Global Networking Protocol☆15Jan 26, 2024Updated 2 years ago
- Macro Lambda Calculus☆50Mar 23, 2019Updated 6 years ago
- ☆115Dec 1, 2024Updated last year
- A proof assistant for higher-dimensional type theory☆236Jan 26, 2026Updated last month
- Optimal evaluator of λ-calculus terms.☆285Feb 4, 2023Updated 3 years ago
- Molecular computers with interaction combinators like graph rewrite systems☆17Nov 9, 2022Updated 3 years ago
- toy implementation of Hindley-Milner type system that prints out inference steps☆17Oct 26, 2025Updated 4 months ago
- Specification of the Formality proof and programming language☆42Feb 5, 2023Updated 3 years ago
- A formalization of System Fω in Agda☆20Dec 23, 2025Updated 2 months ago
- Training GPTs to solve interaction nets☆18Aug 14, 2024Updated last year
- Jupyter notebook for the Lean4 programming language☆25Apr 25, 2022Updated 3 years ago
- A modern supercompiler for call-by-value functional languages☆467Dec 5, 2025Updated 3 months ago
- an experimental new programming language based on interaction nets☆341Updated this week
- Temporary repository for Kind2's refactor based on HVM2☆280Sep 25, 2024Updated last year
- A minimal proof language.☆213Jan 26, 2019Updated 7 years ago
- A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory☆424Updated this week
- Absal ex☆60Sep 8, 2023Updated 2 years ago
- 🧪 | LLVM backend for HVM☆23May 23, 2023Updated 2 years ago
- The Torus Blockchain implementation.☆24Feb 19, 2026Updated 2 weeks ago
- Approximating the joint distribution of language models via MCTS☆22Nov 3, 2024Updated last year
- A simple supercompiler formally verified in Agda☆34Mar 17, 2017Updated 8 years ago
- Par (⅋) is an experimental concurrent programming language. It's an attempt to bring the expressive power of linear logic into practice.☆693Updated this week