This <http://okmij.org/ftp/ML/generalization.html> is a page I wanted to find for a long time. Its title is "How OCaml type checker works -- or what polymorphism and garbage collection have in common".
I suspect that this paper could be the basis of a graduate level seminar :-) It assumes some understanding of type systems, and is an improvement of the famous Hindley-Milner algorithm <https://en.wikipedia.org/wiki/Hindley%E2%80%93Milner_type_system>, which basically I don't understand at all ;-) The following are what intrigue me about this post: - It discusses real code. - It focuses on intuition, not abstruse notation. - It reveals a fascinating connection with type systems and garbage collection. >From recent browsing, I see that WebAssembly can (optionally) use memory faults to ensure memory safety. Drat, I can't seem to find the reference, but I'm sure I didn't make this up. Anyway, this paper is likely the key to understanding the real-world type inference used by OCaml and WebAssembly. Is anyone willing to help me understand it? Edward -- You received this message because you are subscribed to the Google Groups "leo-editor" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/leo-editor. For more options, visit https://groups.google.com/d/optout.
