Due date: 11/05 @ at the beginning of class

The goal of this problem set is to experiment with abstract register machines in Redex and their relationship to standard reduction evaluators.

Problem 1:

Construct a Redex model of the CEK machine for one of the three variants of ISWIM (from problems 5(1), 5(2), or 5(3)). Your model's eval function must produce the same results as the standard reduction semantics.

Problem 2:

Design an evaluator function for language B from chapters I.1 and I.2. (See problem 5(4).)

Design a CK machine for the evaluation of language B. Your machine must produce the same results as the evaluator.

Why is it unnecessary to equip the machine with an E component?