Building a modern functional compiler from first principles. (http:https://dev.stephendiehl.com/fun/)
-
Updated
Jan 11, 2021 - Haskell
Building a modern functional compiler from first principles. (http:https://dev.stephendiehl.com/fun/)
An interpreter for learning and exploring pure λ-calculus
Elsa is a lambda calculus evaluator
🐦 *cheep cheep shriek caw*
An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
🧮 Programming with pure lambda calculus
(λ) Educational lambda calculus interpreter
The compilation target that functional programmers always wanted.
λλλλ Lennart Augustsson's λ-calculus cooked four ways
Map lazy functional language constructs to LLVM IR
Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficient LLVM IR.
λtext - higher-order file applicator
Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck
Implementing a small functional language with a combinator based graph-reduction machine
Functional Quantum Programming
a library for experimental linear lambda calculus
Haskell implementation of interaction net-based lambda evaluation
Efficient and single-steppable ULC evaluation algorithm
A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
Add a description, image, and links to the lambda-calculus topic page so that developers can more easily learn about it.
To associate your repository with the lambda-calculus topic, visit your repo's landing page and select "manage topics."