{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:07Z","timestamp":1725663787783},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552536"},{"type":"electronic","value":"9783540468035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55253-7_24","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T04:57:04Z","timestamp":1330232224000},"page":"408-417","source":"Crossref","is-referenced-by-count":7,"title":["Type inference for partial types is decidable"],"prefix":"10.1007","author":[{"given":"Patrick M.","family":"O'Keefe","sequence":"first","affiliation":[]},{"given":"Mitchell","family":"Wand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Amadio, R.M., and Cardelli, L. \u201cSubtyping Recursive Types,\u201d Conf. Rec. 1991 ACM Symp. on Principles of Programming Languages, 104\u2013118.","DOI":"10.1145\/99583.99600"},{"key":"24_CR2","unstructured":"Cl\u00e9ment, D., Despeyroux, J., Despeyroux, T., and Kahn, G. \u201cA Simple Applicative Language: Mini-ML\u201d Proc. 1986 ACM Symp. on Lisp and Functional Programming, 13\u201327."},{"key":"24_CR3","first-page":"1","volume":"2","author":"L. Cardelli","year":"1985","unstructured":"Cardelli, L. \u201cBasic Polymorphic Typechecking,\u201d Polymorphism Newsletter 2, 1 (Jan, 1985). Also appeared as Computing Science Tech. Rep. 119, AT&T Bell Laboratories, Murray Hill, NJ.","journal-title":"Polymorphism Newsletter"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Fuh, Y.-C., and Mishra, P. \u201cType Inference with Subtypes,\u201d Proc. European Symposium on Programming (1988), 94\u2013114.","DOI":"10.1007\/3-540-19027-9_7"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Gomard, C.K. \u201cPartial Type Inference for Untyped Functional Programs,\u201d Proc. 1990 ACM Conf. on Lisp and Functional Programming, 282\u2013287.","DOI":"10.1145\/91556.91672"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Henglein, F. \u201cEfficient Type Inference for Higher-Order Binding-Time Analysis,\u201d Functional Programming Languages and Computer Architecture, 5th ACM Conference (J. Hughes, ed.), Springer Lecture Notes in Computer Science, Vol. 523, 1991, pp. 448\u2013472.","DOI":"10.1007\/3540543961_22"},{"key":"24_CR7","unstructured":"Henglein, F. personal communication, 1991."},{"key":"24_CR8","first-page":"29","volume":"146","author":"R. Hindley","year":"1969","unstructured":"Hindley, R. \u201cThe Principal Type-Scheme of an Object in Combinatory Logic,\u201d Trans. Am. Math. Soc. 146 (1969) 29\u201360.","journal-title":"Trans. Am. Math. Soc."},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(83)90136-6","volume":"22","author":"R. Hindley","year":"1983","unstructured":"Hindley, R. \u201cThe Completeness Theorem for Typing \u03bb-Terms\u201d Theoret. Comp. Sci. 22 (1983) 1\u201317. See also Hindley, R. \u201cCurry's Type-rules are Complete with Respect to the F-Semantics Too\u201d Theoret. Comp. Sci. 22 (1983) 127\u2013133.","journal-title":"Theoret. Comp. Sci."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"LeRoy X., and Mauny, M. \u201cDynamics in ML,\u201d Functional Programming Languages and Computer Architecture, 5th ACM Conference (J. Hughes, ed.), Springer Lecture Notes in Computer Science, Vol. 523, 1991, pp. 406\u2013426.","DOI":"10.1007\/3540543961_20"},{"key":"24_CR11","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,\u201d J. Comp. & Sys. Sci. 17 (1978), 348\u2013375.","journal-title":"J. Comp. & Sys. Sci."},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Mitchell, J.C. \u201cCoercion and Type Inference (summary),\u201d Conf. Rec. 11th Ann. ACM Symp. on Principles of Programming Languages (1984), 175\u2013185.","DOI":"10.1145\/800017.800529"},{"key":"24_CR13","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1017\/S0956796800000113","volume":"1","author":"J. C. Mitchell","year":"1991","unstructured":"Mitchell, J.C. \u201cType Inference with Simple Subtypes,\u201d J. of Functional Programming 1 (1991), 245\u2013285.","journal-title":"J. of Functional Programming"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"R\u00e9my, D. \u201cTypechecking records and variants in a natural extension of ML,\u201d Conf. Rec. 16th Ann. ACM Symp. on Principles of Programming Languages (1989), 77\u201388.","DOI":"10.1145\/75277.75284"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Thatte, S. \u201cType Inference with Partial Types,\u201d Proc. ICALP '88 (1988), 615\u2013629.","DOI":"10.1007\/3-540-19488-6_146"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Wand, M., and O'Keefe, P. \u201cOn the Complexity of Type Inference with Coercion,\u201d Conf. on Functional Programming Languages and Computer Architecture (London, September, 1989).","DOI":"10.1145\/99370.99394"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Wand, M. \u201cA Semantic Prototyping System,\u201d Proc. ACM SIGPLAN '84 Compiler Construction Conference (1984) 213\u2013221.","DOI":"10.1145\/502874.502895"},{"key":"24_CR18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.3233\/FI-1987-10202","volume":"10","author":"M. Wand","year":"1987","unstructured":"Wand, M. \u201cA Simple Algorithm and Proof for Type Inference\u201d Fundamenta Informaticae 10 (1987), 115\u2013122.","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","ESOP '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55253-7_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T23:16:46Z","timestamp":1640906206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55253-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552536","9783540468035"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-55253-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}