{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:54Z","timestamp":1761611214378,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417392"},{"type":"electronic","value":"9783540447160"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44716-4_16","type":"book-chapter","created":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T18:16:34Z","timestamp":1187201794000},"page":"248-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A General Type Inference Framework for Hindley\/Milner Style Systems"],"prefix":"10.1007","author":[{"given":"Martin","family":"Sulzmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,21]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"A. Aiken and E. L. Wimmers. Type inclusion constraints and type inference. In FPCA \u201993: Conference on Functional Programming Languages and Computer Architecture, Copenhagen, Denmark, pages 31\u201341, New York, June 1993. ACM Press.","DOI":"10.1145\/165180.165188"},{"key":"16_CR2","unstructured":"L. Damas. Type Assignment in Programming Languages. PhD thesis, Edinburgh University, 1985."},{"key":"16_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-60360-3_36","volume-title":"Proc. Second Int. Symp. Static Analysis","author":"D. Dussart","year":"1995","unstructured":"D. Dussart, F. Henglein, and C. Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In A. Mycroft, editor, Proc. Second Int. Symp. Static Analysis, volume 983 of Lecture Notes in Computer Science, pages 118\u2013135. Springer-Verlag, 1995."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"L. Damas and R. Milner. Principal type-schemes for functional programs. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, pages 207\u2013212. ACM, ACM, January 1982.","DOI":"10.1145\/582153.582176"},{"key":"16_CR5","series-title":"Technical Report","volume-title":"Type inference and equational theories","author":"A. J. Kennedy","year":"1996","unstructured":"A. J. Kennedy. Type inference and equational theories. Technical Report LIX\/RR\/96\/09, LIX, Ecole Polytechnique, 91128 Palaiseau Cedex, France, September 1996."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"_D. S. Lankford, G. Butler, and B. Brady. Abelian group unification algorithms for elementary terms. In W. Bledsoe and W. Loveland, editors, Automated Theorem Proving: After 25 Years. AMS, 1984.","DOI":"10.1090\/conm\/029\/749246"},{"issue":"4","key":"16_CR7","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1145\/291891.291892","volume":"20","author":"O. Lee","year":"1998","unstructured":"O. Lee and K. Yi. Proofs about a folklore let-polymorphic type inference algorithm. ACM Transactions on Programming Languages and Systems, 20(4):707\u2013723, 1998.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"16_CR8","unstructured":"O. Lee and K. Yi. A generalized let-polymorphic type inference algorithm. Technical Memorandum ROPAS-2000-5, Research on Program Analysis System, Korea Advanced Institute of Science and Technology, March 2000."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348\u2013375, Dec 1978.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1017\/S0956796800001325","volume":"5","author":"T. Nipkow","year":"1995","unstructured":"T. Nipkow and C. Prehofer. Type reconstruction for type classes. Journal of Functional Programming, 5(2):201\u2013224, 1995.","journal-title":"Journal of Functional Programming"},{"issue":"6","key":"16_CR11","first-page":"805","volume":"6","author":"A. Ohori","year":"1995","unstructured":"A. Ohori. A polymorphic record calculus and its compilation. ACM TOPLAS, 6(6):805\u2013843, November 1995.","journal-title":"ACM TOPLAS"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/(SICI)1096-9942(199901\/03)5:1<35::AID-TAPO4>3.0.CO;2-4","volume":"5","author":"M. Odersky","year":"1999","unstructured":"M. Odersky, M. Sulzmann, and M Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1):35\u201355, 1999.","journal-title":"Theory and Practice of Object Systems"},{"key":"16_CR13","unstructured":"D. R\u00e9my. Extending ML type system with a sorted equational theory. Technical Report 1766, INRIA, October 1992."},{"key":"16_CR14","series-title":"PhD thesis","volume-title":"A General Framework for Hindley\/Milner Type Systems with Constraints","author":"M. Sulzmann","year":"2000","unstructured":"M. Sulzmann. A General Framework for Hindley\/Milner Type Systems with Constraints. PhD thesis, Yale University, Department of Computer Science, May 2000."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"M. Sulzmann. A general type inference framework for Hindley\/Milner style systems. Technical report, Dept. of Computer Science and Software Engineering, The University of Melbourne, 2000. URL: http:\/\/www.cs.mu.oz.au\/sulzmann\/publications\/inference.ps.","DOI":"10.1007\/3-540-44716-4_16"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44716-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T22:20:50Z","timestamp":1612822850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44716-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417392","9783540447160"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44716-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"21 March 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}