Exercise 3

Let be the SFUN program:

More formally, we can define :

  • Since , then and .
  • Since . then \text{..}$

And is an environment where:

  1. Show is typeable.

Exercise 4

Prove by induction that . Base Case: then [FINISH THIS]