help! <

How to use

In short:
\, L or λ for λ.
Type in a lambda calculus term; get back its reduced normal form!

Beta-Red defines a few common shorthand lambda calculus terms as builtins:

• 0, 1, 2, and other positive integers as their Church numerals
• plus and multiply, each taking in two numbers
• pred, the predecessor function, and succ, the successor function
• fact (factorial) and fib (fibonacci)
• true and false as Church booleans (as well as a syntactically gratuitous if)
• not, and and or

What is this?

Beta-Red is a Wasm-based lambda calculus interpreter written in Rust. You can see the source code here!

Lambda calculus is a simple formal system which you can think of as the tiniest Turing-complete language.
The entire language consists of only functions, called abstractions, which look like this:

λx.a

WIP

(λx.λy.x y) t
λy.t y

WIP