Skip to content
scrambled
Programming Language Theory Concept

Call by value

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

INFO

(Lambda calculus, Semantics) A Strict/Eager evaluation strategy in which Beta-redex/Reducible expressions inside lambda abstractions must not be reduced.

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

  • t1→t1′t1 t2→t1′ t2

  • t2→t2′v1 t2→v1 t2′

  • (λx. t) v→[x→v]t