Footnotes
Irken originally used a constraint-based type inference algorithm, based directly on Chapter 10 of "Advanced Topics in Types and Programming Languages". An extended version of the chapter is available online.
It currently uses a simpler, classic Hindley-Milner solver, but the constraint-based algorithm may be brought back, since it is more flexible.
This project is the culmination of about 15 years of work with Scheme, originally inspired by The Essentials of Programming Languages. All three editions are excellent, and very different books. The first edition is the largest and most challenging; but it contains a lot more information about continuation-passing style than the others.
Other critical references:
- Friedman, Wand, & Haynes, "The Essentials of Programming Languages". (all three editions)
- Appel, "Compiling with Continuations". (also available online)
- Appel, "Modern Compiler Implementation in ML".
- Jones & Lins, "Garbage Collection: Algorithms for Automatic Dynamic Memory Management".
- Pierce, "Types and Programming Languages".
- Pierce, "Advanced Topics in Types and Programming Languages".
- Pottier, Rémy, Chapter 10: The Essence of ML Type Inference
- Okasaki, "Purely Functional Data Structures".
The following books have the additional advantage of being available online for free. Many thanks to the authors!
- Peyton-Jones, "The Implementation of Functional Programming Languages".
- Krishnamurthi, "Programming Languages: Application and Interpretation"
[XXX: I have a stack of 20 or so papers that should also be listed here]
- See Hacking Notes...