An interpreter for learning and exploring pure λ-calculus
-
Updated
Apr 11, 2021 - Haskell
An interpreter for learning and exploring pure λ-calculus
🧮 Programming with pure lambda calculus
The λ-calculus in Haskell
⚡ Functional Programming Course
A Haskell implementation of a Lambda Calculus interpreter supporting Normal and Applicative reduction strategies. Features include a powerful REPL, macro definitions, and a standard library with Church encodings for Booleans, Numerals, and Pairs. A comprehensive tool for understanding functional programming foundations.
Add a description, image, and links to the church-encoding topic page so that developers can more easily learn about it.
To associate your repository with the church-encoding topic, visit your repo's landing page and select "manage topics."