1. (10 points) Determine, for each assertion, whether it is true or false. a. It is not necessary to use closures, or similar abstractions for func...

1. (10 points) Determine, for each assertion, whether it is true or false.
a. It is not necessary to use closures, or similar abstractions for functional values, for the implementation of languages without higher-order functions.
b. The semantics of a programming language is a precise description of all its grammatically correct programs.
c. In languages with static scope, it is possible to evaluate expressions with free variables without predefined values.
d. An advantage of dynamic scope over static scope is that it generally facilitates program analysis.
e. Higher-order functions can take other functions as arguments.
f. A polymorphic function has, in principle, an infinite family of types.
g. The purpose of formal semantics is to describe how a programming language can be implemented efficiently.
h. There are programs in SML whose functionality cannot be encoded in lambda calculus.
i. The operational semantics of a programming language defines, through a set of inference rules, how the execution of a program occurs step by step.
j. In languages with parametric polymorphism, any function can be defined without restrictions on the types of its arguments.

a. True
b. True
c. True
d. False
e. True
f. True
g. False
h. True
i. True
j. True