Skip to content
scrambled
Programming Language Theory Flashcard

What are the syntax/values/evaluation relation for the untyped lambda calculus?

Question

What are the syntax/values/evaluation relation for the untyped lambda calculus?

Answer

Syntax:

t:=λx. t|t t

Values:

v:=λx. t

Evaluation rules, assuming call by value:

t1→t1′t1 t2→t1′ t2t1→t1′v t1→v t2(λx. t) v→[x→v]t