Sections 3.3 - 3.6

Question 1

A program is a set of ___ and a ___.

Answer 1

set of definitions and an expression to be evaluated

Question 2

The translation scheme TE can be regarded as a function from ____ to ____.

Answer 2

Miranda expressions to lambda expressions

Question 3

The translation scheme TD translates ____ to ____.

Answer 3

Miranda definitions to letrec definitions

Question 4

The translation rule for infix operators translates the operator to accommodate a ____.

Answer 4

change of names

Question 5

True or false: The TD and TE translation schemes are inductive.

Answer 5

True. Both translation schemes are defined in terms of how they operate on the simplest expressions (the base case) and on compound expressions (the inductive case).

Question 6

True or false: The TD scheme depends on TE.

Answer 6

True. To translate a Miranda definition one must also translate the body of the definition, which is a Miranda expression.

Question 7

Translate the following Miranda definitions to letrec definitions:
f x y = g (x + 3) y
g z = z * z

Answer 7

letrec
g = \z -> z * z
f = \x y -> g (x + 3) y