CS 6520 Homework 17

Exercise 17.1

The lambda calculus expression can be turned into an expression in the typed lambda calculus with iso-recursive types by
  1. inserting a type expression at each binding of x; and
  2. wrapping certain expressions with an appropriate fold or unfold form.

Show the typed version of the above expression, and show its type derivation.

Last update: Thursday, March 23rd, 2000