Optimal evaluator of λ-calculus terms.
☆284Feb 4, 2023Updated 3 years ago
Alternatives and similar repositories for abstract-algorithm
Users that are interested in abstract-algorithm are comparing it to the libraries listed below
Sorting:
- ☆36Jul 30, 2018Updated 7 years ago
- An optimal function evaluator written in JavaScript.☆139Jul 25, 2017Updated 8 years ago
- Absal ex☆59Sep 8, 2023Updated 2 years ago
- A minimal proof language.☆212Jan 26, 2019Updated 7 years ago
- A nano "theorem prover".☆62Feb 15, 2019Updated 7 years ago
- A programming language and model of computation that matches the optimal λ-calculus reduction algorithm perfectly.☆931Nov 13, 2025Updated 3 months ago
- Thoughts and stuff☆72Apr 30, 2020Updated 5 years ago
- learning cuda☆19Jun 27, 2016Updated 9 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- A bare-bones calculus-of-constructions☆383Sep 4, 2022Updated 3 years ago
- GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.☆1,057Jun 13, 2025Updated 8 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- Multiplication on optimal λ-calculus reducers☆22Aug 14, 2020Updated 5 years ago
- Macro Lambda Calculus☆50Mar 23, 2019Updated 6 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆18Jun 17, 2019Updated 6 years ago
- Functional programming with fewer indirections☆781Aug 20, 2020Updated 5 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Jan 3, 2018Updated 8 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last week
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- A lambda calculus to explore type-directed program synthesis.☆85Jan 20, 2020Updated 6 years ago
- Demo for high-performance type theory elaboration☆585Feb 2, 2026Updated 3 weeks ago
- Compiling to Categories☆458Feb 28, 2024Updated 2 years ago
- A modern proof language☆3,727Jan 22, 2025Updated last year
- Haskell Type Level Example Programs☆28Nov 30, 2017Updated 8 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆85Feb 17, 2017Updated 9 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- Inpla: Interaction nets as a programming language (the current version)☆325Jan 11, 2026Updated last month
- Specification of the Cedille Core language☆35Jul 21, 2020Updated 5 years ago
- Minimal implementations for dependent type checking and elaboration☆768Jan 30, 2026Updated last month
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Feb 15, 2018Updated 8 years ago
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- Frank compiler☆305Apr 23, 2024Updated last year
- convert simple cryptol expressions into finite-state machines☆22Sep 15, 2017Updated 8 years ago
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆390Oct 23, 2023Updated 2 years ago