Phil Freeman on Principal Type-schemes for Functional Programs

Los Angeles - June 24, 2015

Phil Freeman on Principal Type-schemes for Functional Programs

• Meetup: http://www.meetup.com/Papers-We-Love-LA/events/223161204/
• Paper: http://web.cs.wpi.edu/~cs4536/c12/milner-damas_principal_types.pdf
• Slides: https://docs.google.com/presentation/d/1NGil0cL2R35NLwFUtHFgR7Ydgsc–HYdLxp6mp2vGog/edit#slide=id.p
• Code: https://gist.github.com/paf31/a49a54d7ea5ede43422f

Description

The Damas-Hindley-Milner type system is a classical system for the first-order polymorphic lambda calculus, and the ML family of programming languages. This paper introduces Algorithm W, a simple algorithm for type reconstruction in the DHM type system. I'll walk through the main results of the paper, and compare the DHM type system with other more modern systems.

Bio

Phil Freeman is an engineer at DicomGrid. He is the original developer of the PureScript compiler, author of PureScript by Example, a Haskeller & PLT enthusiast.

Papers We Love Los Angeles would like to thank Brainium for hosting this month's meetup.