To save you hours of looking: these notes are quite good, building up from the fundamentals to the details in only 20 pages and even discusses the Curry-Howard isomorphism in more depth than I've seen so far in any PL stuff. And it includes exercises and answers!
Everything refers back to the Damas-Milner algorithm published in a 1982 paper that looks like it was written on a typewriter. Heh.
