Please note, due to essential maintenance online purchasing will be unavailable between 08:00 and 12:00 (BST) on 24th February 2019. We apologise for any inconvenience.
Plotkin (1975) showed that the lambda calculus is a good model
of the evaluation process for
call-by-name functional programs. Reducing programs to constants or
according to the leftmost-outermost strategy exactly mirrors execution
an abstract machine
like Landin's SECD machine. The machine-based evaluator returns a
constant or the token
Email your librarian or administrator to recommend adding this journal to your organisation's collection.