{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T10:28:32Z","timestamp":1777544912191,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1007\/bf03037279","type":"journal-article","created":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T02:41:46Z","timestamp":1240540906000},"page":"1-36","source":"Crossref","is-referenced-by-count":9,"title":["Proofs of a set of hybrid let-polymorphic type inference algorithms"],"prefix":"10.1007","volume":"22","author":[{"given":"Hyunjun","family":"Eo","sequence":"first","affiliation":[]},{"given":"Oukseh","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Kwangkeun","family":"Yi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF03037279_CR1","doi-asserted-by":"crossref","unstructured":"Aiken, A. and Wimmers, E. L., \u201cType Inclusion Constraints and Type Inference,\u201d inProc. of Functional Programming Languages and Computer Architecture, pp. 31\u201341, 1993.","DOI":"10.1145\/165180.165188"},{"key":"BF03037279_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/176454.176460","volume":"2","author":"M. Beaven","year":"1993","unstructured":"Beaven, M. and Stansifer, R., \u201cExplaining Type Errors in Polymorphic Languages,\u201dACM Letters on Programming Languages and Systems, 2, pp. 17\u201330, Mar.\u2013Dec. 1993.","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"BF03037279_CR3","unstructured":"Bernstein, K. L. and Stark, E. W., \u201cDebugging Type Errors (Full Version),\u201dTechnical Report, State University of New York at Stony Brook, 1995."},{"key":"BF03037279_CR4","doi-asserted-by":"crossref","unstructured":"Chitil, O., \u201cCompositional Explanation of Types and Algorithmic Debugging of Type Errors,\u201d inProc. of the 6th ACM SIGPLAN International Conference on Functional Programming, pp. 193\u2013204, Sept. 2001.","DOI":"10.1145\/507635.507659"},{"key":"BF03037279_CR5","unstructured":"Cho, K. and Ueda, K., \u201cDiagnosing Non-well-moded Concurrent Logic Programs,\u201d inJoint International Conference on Logic Programming, pp. 215\u2013229, MIT Press, 1996."},{"key":"BF03037279_CR6","first-page":"207","volume-title":"Proc. of the 9th Annual ACM Symposium on Principles of Programming Languages","author":"L. Damas","year":"1982","unstructured":"Damas, L. and Milner, R., \u201cPrincipal Type-scheme for Functional Programs,\u201d inProc. of the 9th Annual ACM Symposium on Principles of Programming Languages, pp. 207\u2013212, ACM Press, New York, 1982."},{"key":"BF03037279_CR7","unstructured":"Duggan, D., \u201cCorrect Type Explanation,\u201d inProc. of Workshop on ML, pp. 49\u201358, 1998."},{"issue":"1","key":"BF03037279_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0167-6423(95)00007-0","volume":"27","author":"D. Duggan","year":"1996","unstructured":"Duggan, D. and Bent, F., \u201cExplaining Type Inference,\u201dScience of Computer Programming, 27, 1, pp. 37\u201383, July 1996.","journal-title":"Science of Computer Programming"},{"issue":"2","key":"BF03037279_CR9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/169701.169692","volume":"15","author":"F. Henglein","year":"1993","unstructured":"Henglein, F., \u201cType Inference with Polymorphic Recursion,\u201dACM Transactions on Programming Languages and Systems, 15, 2, pp. 253\u2013289, April 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"4","key":"BF03037279_CR10","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1145\/291891.291892","volume":"20","author":"O. Lee","year":"1998","unstructured":"Lee, O. and Yi, K., \u201cProofs about a Folklore Let-polymorphic Type Inference Algorithm,\u201dACM Transactions on Programming Languages and Systems, 20, 4, pp. 707\u2013723, July 1998.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"BF03037279_CR11","unstructured":"Leroy, X., Doligez, D., Garrigue, J., R\u00e9my, D. and Vouillon, J., \u201cThe Objective Caml System Release 3.06,\u201d Institut National de Recherche en Informatique et en Automatique, August 2002. http:\/\/caml.inria.fr."},{"key":"BF03037279_CR12","unstructured":"McAdam, B. J., \u201cOn the Unification of Substitutions in Type Inference,\u201d inProc. of The International Workshop on Implementation of Functional Languages (Hammond, K., Davie, A. J. T. and Clack, C. eds.),vol. 1595 of Lecture Notes in Computer Science, pp. 139\u2013154, Springer-Verlag, Sept. 1998."},{"key":"BF03037279_CR13","unstructured":"McAdam, B. J., \u201cGeneralising Techniques for Type Debugging,\u201d inProc. of 1st Scottish Functional Programming Workshop, 1999."},{"key":"BF03037279_CR14","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"Milner, R., \u201cA Theory of Type Polymorphism in Programming,\u201dJournal of Computer and System Sciences, 17, pp. 348\u2013375, 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF03037279_CR15","doi-asserted-by":"crossref","unstructured":"Odersky, M., Sulzmann, M. and Wehr, M., \u201cType Inference with Constrained Types,\u201dTheory and Practice of Object Systems,5,1, 1999.","DOI":"10.1002\/(SICI)1096-9942(199901\/03)5:1<35::AID-TAPO4>3.0.CO;2-4"},{"key":"BF03037279_CR16","series-title":"Research Report","volume-title":"Extending ML Type System with a Sorted Equational Theory","author":"D. R\u00e9my","year":"1992","unstructured":"R\u00e9my, D., \u201cExtending ML Type System with a Sorted Equational Theory,\u201dResearch Report 1766, Institut National de Recherche en Informatique et Automatisme, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, 1992."},{"key":"BF03037279_CR17","unstructured":"Rideau, L. and Th\u00e9ry, L., \u201cInteractive Programming Environment for ML,\u201dTechnical Report 3139, Institut National de Recherche en Informatique et en Automatique, Mar. 1997."},{"issue":"1","key":"BF03037279_CR18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"Robinson, J. A., \u201cA Machine-oriented Logic Based on the Resolution Principle,\u201dJournal of ACM, 12, 1, pp. 23\u201341, Jan. 1965.","journal-title":"Journal of ACM"},{"key":"BF03037279_CR19","unstructured":"The Standard ML of New Jersey, release 110.0.7. Bell Labs, Lucent Technologies, Sept. 2001. http:\/\/cm.bell-labs.com\/cm\/cs\/what\/smlnj."},{"key":"BF03037279_CR20","doi-asserted-by":"crossref","unstructured":"Sulzmann, M., \u201cA General Type Inference Framework for Hindley\/Milner Style Systems,\u201d inProc. of 5th International Symposium on Functional and Logic Programming, Mar. 2001.","DOI":"10.1007\/3-540-44716-4_16"},{"key":"BF03037279_CR21","unstructured":"Sulzmann, M., M\u00fcller, M. and Zenger, C., \u201cHindley\/Milner Style Type Systems in Constraint Form,\u201dTechnical Report ACRC-99-009, University of South Australia, School of Computer and Information Science, Jul. 1999."},{"issue":"1","key":"BF03037279_CR22","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(94)90056-6","volume":"124","author":"S. R. Thatte","year":"1994","unstructured":"Thatte, S. R., \u201cType Inference with Partial Types,\u201dTheoretical Computer Science, 124, 1, pp. 127\u2013148, Feb. 1994.","journal-title":"Theoretical Computer Science"},{"key":"BF03037279_CR23","first-page":"38","volume-title":"Proc. of the 13th Annual ACM Symposium on Principles of Programming Languages","author":"M. Wand","year":"1986","unstructured":"Wand, M., \u201cFinding the Source of Type Errors,\u201d inProc. of the 13th Annual ACM Symposium on Principles of Programming Languages, pp. 38\u201343, ACM Press, New York, 1986."},{"key":"BF03037279_CR24","unstructured":"Yang, J., \u201cExplaining Type Errors by Finding the Sources of Type Conflicts,\u201d inProc. of 1st Scottish Functional Programming Workshop, pp. 387\u2013401, Aug. 1999."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037279.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037279\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:52:33Z","timestamp":1558572753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["BF03037279"],"URL":"https:\/\/doi.org\/10.1007\/bf03037279","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}