Go backward to Functions as Equations Go up to Top Go forward to Semantic Domains

Evaluation of Equations

• Definition f:A => B, f(x) = alpha
• Application f(a₀)
  1. Substitution [a₀/x]alpha
  2. Simplification to underlying value

Lambda Notation f=lambda x.alpha

split-add(x) = lambda y.x+y
slit-add = lambda x.lambda y.x+y

Updating Functions [a₀ |-> b₀]f

([a₀ |-> b₀]f)(a₀) = b₀
([a₀ |-> b₀]f)(a) = f(a), for all a != a₀