Simple Kombinator Interpreter

Welcome to the combinatory logic interpreter.

Type an expression in the entry field and click ▶︎. A valid expression contains one or more terms and parenthesis around groups of terms. Unknown terms will be considered free variables and left as is.

New terms can be declared by prepending "name = " to the expression. They will appear in the box on the right and can be clicked to add them to the expression.

The interpreter supports lambda calculus and Church numerals. Lambda expressions are written as x->y->z-><expression>. Church numerals are written as non-negative integers.

The →SK button converts an expression into the SKI basis, term by term, and the →λ button attempts to find the shortest equivalent lambda term.

Enter ? to get detailed info on syntax.

Term inventory: