An optimal function evaluator written in JavaScript.
☆139Jul 25, 2017Updated 8 years ago
Alternatives and similar repositories for optlam
Users that are interested in optlam are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Optimal evaluator of λ-calculus terms.☆285Feb 4, 2023Updated 3 years ago
- Haskell implementation of interaction net-based lambda evaluation☆21Jun 24, 2016Updated 9 years ago
- Macro Lambda Calculus☆50Mar 23, 2019Updated 7 years ago
- A modern syntax for the λ-calculus.☆417Jun 28, 2016Updated 9 years ago
- ☆36Jul 30, 2018Updated 7 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Absal ex☆59Sep 8, 2023Updated 2 years ago
- Thoughts and stuff☆73Apr 30, 2020Updated 6 years ago
- learning cuda☆20Jun 27, 2016Updated 9 years ago
- my personal lang☆18Dec 31, 2023Updated 2 years ago
- A minimal proof language.☆215Jan 26, 2019Updated 7 years ago
- Base Formality libraries☆10Mar 4, 2019Updated 7 years ago
- A minimal proof checker.☆80Sep 9, 2024Updated last year
- Specification of the Formality proof and programming language☆43Feb 5, 2023Updated 3 years ago
- microkanren in sml☆27Feb 26, 2015Updated 11 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Wrap promises, never use .catch again☆25Jan 11, 2023Updated 3 years ago
- A bare-bones calculus-of-constructions☆385Sep 4, 2022Updated 3 years ago
- VM and tracing JIT for Haskell (work in progress)☆79Oct 25, 2014Updated 11 years ago
- Did someone say types?☆13Sep 5, 2016Updated 9 years ago
- A series of implementations of a simple functional programming language.☆30Jan 4, 2016Updated 10 years ago
- experiments with pext/pdep and codebruijn syntax☆17Nov 17, 2019Updated 6 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆18Jun 17, 2019Updated 6 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆85Feb 17, 2017Updated 9 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Jan 3, 2018Updated 8 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Resin: high performance variable binder and ast manipulation lib☆13Jan 1, 2019Updated 7 years ago
- Distributed programming language that desugars to Morte☆93Sep 4, 2022Updated 3 years ago
- A nano "theorem prover".☆63Feb 15, 2019Updated 7 years ago
- A set of tools for building graph rewriting systems and more specifically, working with the chemlambda rewrite model of computation.☆12Dec 27, 2016Updated 9 years ago
- Fun, interesting, and thought-provoking examples of relational Scheme interpreters at work☆14Mar 6, 2015Updated 11 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated this week
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101May 9, 2017Updated 9 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- Emoj is a modern, concatenative language for the browser. (april's fool project)☆20Mar 19, 2019Updated 7 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- ☆116Aug 14, 2015Updated 10 years ago
- A Peer-to-Peer Operating System☆37Mar 17, 2019Updated 7 years ago
- A Haskell implementation of the Formality language☆18Mar 9, 2020Updated 6 years ago
- CS1 through Type Theory☆17Jan 4, 2017Updated 9 years ago
- Remake of the classical game Sokoban in Elm☆11Dec 28, 2016Updated 9 years ago
- A small implementation of higher-order unification☆194Aug 6, 2017Updated 8 years ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆378May 14, 2023Updated 2 years ago