26

The essential construct of lambda calculus is called the lambda application.

True

False

Question 27

In Scheme, the letrec form makes a global binding of a variable visible in the top-level environment.

True

False

Question 28

Which of the following statements is correct?

A language with nonstrict functions is easier to implement.

A function that will produce well-defined results, even when subexpressions or parameters may be undefined, is said to be strict.

Delayed execution can lead to well-defined results, even when subexpressions or parameters may be undefined.

Nonstrictness is always an undesirable property in a language

Question 29

To determine if two lists have the same fringe, we must flatten them to just lists of their atoms.

True

False

30

The Scheme evaluation rule represents ____ evaluation.

		applicative order
		normal order
		binary order
		sequential order