[plt-scheme] The Lambda Calculus behind functional programming

Here are the papers on types that you want to add to the reading list:

H.B. Curry. Modified basic functionality in combinatory logic. Dialec-
tica, 23:83–92, 1969.

J. Roger Hindley. The principal type scheme of an object in combinatory
logic. Transactions of the American Mathematical Society, 146:29–40,
1969.

Robin Milner. A theory of type polymorphism in programming. JCSS,
17:348–375, 1978.

John C. Reynolds. Towards a theory of type structure. In Program-
ming Symposium, Proceedings Colloque sur la Programmation, pages
408–423, London, UK, 1974. Springer-Verlag.

The last two are essential, original source for a CS guy. The
first two are history.

;; ---

All this is for someone who has HtD under his belt because I
believe in bottom-up learning, though "Macht der Abstraktion"
appears to be doing a good job of adding some LC to HtDP.

-- Matthias