Question 41

In Scheme, a let special form can be used to define a recursive function.

True

False

1 points

Question 42

In Scheme, arithmetic operators are written as infix operators.

True

False

1 points

Question 43

In lambda calculus, a conversion that allows for the elimination of redundant lambda abstractions is call ____.

		eta-conversion
		alpha-conversion
		beta-conversion
		beta-abstraction

1 points

Question 44

Python uses statement terminators such as the semicolon.

True

False

1 points

Question 45

Java demonstrates a lack of orthogonality in its different handling of primitive data types and object data types.

True

False

1 points