1. Consider inferencing the type of the term shown below using the Hindley-Milner algorithm. let kxy...

 

Transcribed Image Text:

1. Consider inferencing the type of the term shown below using the Hindley-Milner algorithm. let k\x\y > x in s k k Show the type inferencing of the body of the let expression by specifying the type environments I'; and I, substitutions i, and the types ti in the figure below. Assume s is a builtin function with types: Vay.(ay) (a) a y k S 4 K 14 5 1. Consider inferencing the type of the term shown below using the Hindley-Milner algorithm. let k\x\y > x in s k k Show the type inferencing of the body of the let expression by specifying the type environments I'; and I, substitutions i, and the types ti in the figure below. Assume s is a builtin function with types: Vay.(ay) (a) a y k S 4 K 14 5