A HTML/JS web application that converts a Turing machine to an untyped lambda calculus term (and vice versa) within a polynomial time complexity.
-
Updated
Aug 1, 2023 - JavaScript
A HTML/JS web application that converts a Turing machine to an untyped lambda calculus term (and vice versa) within a polynomial time complexity.
An iterative untyped lambda calculus interpreter written in JavaScript.
Perform computation using purely abstract λ-functions
Add a description, image, and links to the lambda-calculus-evaluator topic page so that developers can more easily learn about it.
To associate your repository with the lambda-calculus-evaluator topic, visit your repo's landing page and select "manage topics."