Skip to content
scrambled
Programming Language Theory Concept

Call by name

Books JourneyProgramming Language Theory Statusmastered Tags
  • language feature design
  • semantics

INFO

(Lambda calculus, Semantics) An evaluation strategy that is Normal order but Beta-reduction inside Lambda abstraction is not allowed.

In pure lambda calculus, this strategy is defined by the following rules:

  • t1→t1′t1 t2→t1′ t2

  • (λx. t1) t2→[x→t2]t1