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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆121Feb 1, 2024Updated 2 years ago
- my personal lang☆18Dec 31, 2023Updated 2 years ago
- A programming language and model of computation that matches the optimal λ-calculus reduction algorithm perfectly.☆944Nov 13, 2025Updated 5 months ago
- Collection of Kind2 programs and proofs☆12May 17, 2024Updated last year
- Meta-programming utilities for Agda.☆20Apr 24, 2026Updated 2 weeks ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Animation of Yves Lafont's Interaction Combinators☆23Jan 30, 2022Updated 4 years ago
- A Lévy-optimal lambda calculus reducer with a backdoor to C☆44Mar 23, 2026Updated last month
- A massively parallel, optimal functional runtime in Rust☆31Aug 7, 2024Updated last year
- A minimal pure functional language based on self dependent types.☆73May 11, 2022Updated 3 years ago
- Agda to C compiler☆10Sep 23, 2025Updated 7 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆85Feb 17, 2017Updated 9 years ago
- HVM3☆283Jan 29, 2026Updated 3 months ago
- ☆496Jun 11, 2024Updated last year
- An implementation of interaction nets as a forth-like language.☆45Nov 16, 2025Updated 5 months ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Inpla: Interaction nets as a programming language (the current version)☆328Updated this week
- An interaction combinator runtime☆18Sep 23, 2024Updated last year
- An efficient, secure cryptocomputer☆615Nov 25, 2023Updated 2 years ago
- Temporary repository for Kind2's refactor based on HVM2☆280Sep 25, 2024Updated last year
- A formalization of System Fω in Agda☆20Dec 23, 2025Updated 4 months ago
- Optimal evaluator of λ-calculus terms.☆285Feb 4, 2023Updated 3 years ago
- Training GPTs to solve interaction nets☆18Aug 14, 2024Updated last year
- Purely local graph rewrite system for the SKI combinator calculus, in chemlambda style.☆20Jul 4, 2023Updated 2 years ago
- toy implementation of Hindley-Milner type system that prints out inference steps☆17Oct 26, 2025Updated 6 months ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- A modern supercompiler for call-by-value functional languages☆475Dec 5, 2025Updated 5 months ago
- Demo for high-performance type theory elaboration☆589Feb 2, 2026Updated 3 months ago
- A proof assistant for higher-dimensional type theory☆253Updated this week
- Damian Nadales's sandbox☆12Updated this week
- A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory☆431Updated this week
- an experimental new programming language based on interaction nets☆361Updated this week
- MnemOS Global Networking Protocol☆16Jan 26, 2024Updated 2 years ago
- ☆17Jan 3, 2025Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆23Apr 1, 2026Updated last month
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- A minimal proof language.☆215Jan 26, 2019Updated 7 years ago
- ☆115Dec 1, 2024Updated last year
- A modern proof language☆3,739Jan 22, 2025Updated last year
- Macro Lambda Calculus☆50Mar 23, 2019Updated 7 years ago
- Molecular computers with interaction combinators like graph rewrite systems☆17Nov 9, 2022Updated 3 years ago
- Par (⅋) is an experimental concurrent programming language. It's an attempt to bring the expressive power of linear logic into practice.☆719Updated this week
- An optimal function evaluator written in JavaScript.☆139Jul 25, 2017Updated 8 years ago