Untyped Lambda-calculus

The untyped Lambda-calculus is a universal notation for defining partial-recursive functions.

Syntax

{
    "lang": "lambda",
    "ast": <expression>
}

The ast represents an expression, which may be one of the following:

{
    "kind": "variable",
    "name": <string>
}

{
    "kind": "abstraction",
    "parameter": <string>,
    "body": <expression>
}

{
    "kind": "application",
    "operator": <expression>,
    "operand": <expression>
}