References¶
| [Damas1982] | Damas, Luis and Milner, Robin. Principal type-schemes for functional programming. Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, ACM, pp. 207–212. |
| [Damas1984] | Damas, Luis. Type Assignment in Programming Languages. PhD. Thesis. University of Edinburgh. 1984. |
| [Eisenberg] | Richard A. Eisenberg and Simon Peyton Jones. Levity Polymorphism |
| [Jones1994] | Jones, Mark P. Qualified Types: Theory and Practice. PhD thesis. Cambridge University Press. |
| [Jones] | Jones, Mark P. Typing Haskell in Haskell. Nov 2000. Online article and code: https://gist.github.com/chrisdone/0075a16b32bfd4f62b7b |
| [Mycroft1984] | Mycroft, Alan. Polymorphic Type Scheme and Recursive Definitions. International Symposium on Programming, 6th Colloquium. Toulouse, April 1984. Proceedings. LNCS 167. Springer-Verlag. pp. 217-228. |
| [Odersky1999] | Sulzmann, Martin; Odersky, Martin; and Wehr, Martin. Type Inference with Constrained Types. Theory and Practice of Object Systems · January 1999. https://www.researchgate.net/publication/220346751 |
| [OutsideInX] | Vytiniotis, Dimitrios; Peyton Jones, Simon L; Schrijvers, Tom; and Sulzmann, Martin. OutsideIn(X). Modular type inference with local assumptions. 2011. https://www.microsoft.com/en-us/research/publication/outsideinx-modular-type-inference-with-local-assumptions/ |
| [PeytonJones1987] | Peyton Jones, Simon L; with chapters by Wadler, Philip; Hancock, Peter; and Turner, David. The implementation of functional programming languages. Prentice-Hall. |
| [PeytonJones2011] | Peyton Jones, Simon L; Vytiniotis, Dimitrios; Weirich, Stephanie; and Shields, Mark. Practical type inference for arbitrary rank-types. 2011. http://research.microsoft.com/~simonpj/papers/higher-rank |
| [Pierce2000] | Pierce, Benjamin C. and Turner, David N. Local Type Inference. ACM Transactions on Programming Languages and Systems, Vol. 22, No. 1, January 2000, Pages 1–44. http://www.cis.upenn.edu/~bcpierce/papers/lti-toplas.pdf |
| [Pierce2005] | Pierce, Benjamin (ed.). Advanced Topics in Types and Programming Languages (ATPL). The MIT Press. 2005. |
| [PottierATPL2005] | Pottier, François; and Rémy, Didier. The Essence of ML Type Inference; chapter 10 of [Pierce2005] pp. 389-489. |
| [Tarjan1972] | Tarjan, Robert. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1 (2): 146–160, doi:10.1137/0201010. https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm |
| [Vytiniotis2006] | Vytiniotis, Dimitrios; Weirich, Stephanie and Peyton Jones, Simon L. Boxy Types: Inference for Higer-Rask Types and Impredicativity. ICFP September 16–21, 2006, Portland, Oregon, USA. https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/boxy-icfp.pdf |
| [Wadler1989] | Wadler, Philip and Blott, Stephen. How to make ad-hoc polymorphism less ad-hoc. POPL ‘89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. https://dl.acm.org/citation.cfm?id=75283 |