University
of Washington • CSE583 • D. Notkin © 2000
73
Representation
lFor
the l-calculus to
be Turing-complete, we need to address some representational issues
lIndeed, it only really has identifiers that don’t really
represent anything
lEven writing + is kind of a cheat