{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:11:14Z","timestamp":1747807874483,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":44,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029599","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"105-120","source":"Crossref","is-referenced-by-count":7,"title":["Type inference problems: A survey"],"prefix":"10.1007","author":[{"given":"Jerzy","family":"Tiuryn","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Boehm, H.-J., \u201cPartial polymorphic type inference is undecidable\u201d, Proc. 26th IEEE Symp. Foundations of Computer Science, pp. 339\u2013345, 1985.","DOI":"10.1109\/SFCS.1985.44"},{"key":"8_CR2","first-page":"51","volume":"173","author":"L. Cardelli","year":"1984","unstructured":"Cardelli, L., \u201cA semantics of multiple inheritance\u201d, In: Semantics of Data Types, Kahn, MacQueen and Plotkin (eds.), LNCS vol. 173, pp 51\u201367, Springer 1984.","journal-title":"LNCS"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A. Church","year":"1940","unstructured":"Church, A. \u201cA formulation of the simple theory of types,\u201d Journal of Symbolic Logic, 5, pp 56\u201368, 1940.","journal-title":"Journal of Symbolic Logic"},{"key":"8_CR4","volume-title":"Object-Oriented Programming: An Evolutionary Approach","author":"B. Cox","year":"1986","unstructured":"Cox, B., \u201cObject-Oriented Programming: An Evolutionary Approach,\u201d Addison-Wesley, Reading, MA, 1986."},{"key":"8_CR5","volume-title":"Combinatory Logic","author":"H.B. Curry","year":"1958","unstructured":"Curry H.B. and Feyes, R. \u201cCombinatory Logic,\u201d North-Holland, Amsterdam, 1958."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Damas, L. and Milner, R., \u201cPrincipal type schemes for functional programs,\u201d Proc. 9-th ACM Symp. Principles of Prog. Lang., pp 207\u2013212, 1982.","DOI":"10.1145\/582153.582176"},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0743-1066(84)90022-0","volume":"1","author":"C. Dwork","year":"1984","unstructured":"Dwork, C., Kanellakis, P., Mitchell, J.C., \u201cOn the sequential nature of unification\u201d, J. of Logic Programming, 1, pp 35\u201350, 1984.","journal-title":"J. of Logic Programming"},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/322358.322370","volume":"30","author":"S. Fortune","year":"1983","unstructured":"Fortune, S., Leivant, D., and O'Donnell, M., \u201cThe expressiveness of simple and second-order type structures\u201d, J. ACM, 30, pp 151\u2013185, 1983.","journal-title":"J. ACM"},{"key":"8_CR9","first-page":"94","volume":"300","author":"Y. Fuh","year":"1988","unstructured":"Fuh, Y., and Mishra, P., \u201cType inference with subtypes\u201d, In Proc. 2nd European Symp. on Programming, ESOP'88 Ganziger (ed.) LNCS vol. 300, pp 94\u2013114, Springer, 1988.","journal-title":"LNCS"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Giannini, P., Ronchi Della Rocca, S., \u201cCharacterization of typings in polymorphic type discipline\u201d, Proc of IEEE 3-rd Symp. Logic in Computer Science, pp 61\u201371, 1988.","DOI":"10.1109\/LICS.1988.5101"},{"key":"8_CR11","unstructured":"Girard, J.-Y., Interpr\u00e9tation fonctionelle et \u00e9limination des coupures de l'arithm\u00e9tique d'ordre sup\u00e9rieure, Doctoral thesis, Universit\u00e9 Paris VII, 1972."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y., \u201cUne extension de l'interpr\u00e9tation de G\u00f6del a l'analyse et son application \u00e0 l'\u00e9limination des coupures dans l'analyse et la th\u00e9orie des types\u201d, in Proc. 2nd Scandinavian Logic Symposium, Fenstad (ed.), North-Holland, 1971.","DOI":"10.1016\/S0049-237X(08)70843-7"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Henglein, F., \u201cType inference and semi-unification\u201d, Proc. ACM Symp. LISP and Functional Programming, July 1988.","DOI":"10.1145\/62678.62701"},{"key":"8_CR14","first-page":"29","volume":"146","author":"J.R. Hindley","year":"1969","unstructured":"Hindley, J.R., \u201cThe principal type-scheme of an object in combinatory logic\u201d, Transactions of the American Mathematical Society, 146, pp 29\u201360, 1969.","journal-title":"Transactions of the American Mathematical Society"},{"issue":"2","key":"8_CR15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.2307\/2269811","volume":"31","author":"P.K. Hooper","year":"1966","unstructured":"Hooper, P.K., \u201cThe undecidability of the Turing machine immortality problem\u201d, Journal of Symbolic Logic, 31, No. 2, pp 219\u2013234, 1966.","journal-title":"Journal of Symbolic Logic"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Jategaonkar, L., \u201cML with Extended Pattern Matching and Subtypes\u201d, MS Thesis, MIT, 1989.","DOI":"10.1145\/62678.62702"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Kanellakis, P., Mitchell, J.C., \u201cPolymorphic unification and ML typing\u201d, Proc. 16-th Symp. on Principles of Prog. Lang., pp 105\u2013115, 1989.","DOI":"10.1145\/75277.75286"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Kapur, D., Musser, D., Narendran, P., and Stillman, J., \u201cSemi-unification\u201d, Proc. of 8-th Conference on Foundations of Software Technology and Theoretical Computer Science, Pune, India, 1988.","DOI":"10.1007\/3-540-50517-2_95"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Kfoury, A.J., Tiuryn, J. and Urzyczyn, P., \u201cA proper extension of ML with an effective type-assignment,\u201d Proc. 15-th ACM Symp. Principles of Programming Languages, pp 58\u201369, 1988.","DOI":"10.1145\/73560.73565"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Kfoury, A.J., Tiuryn, J. and Urzyczyn, P., \u201cType-checking in the presence of polymorphic recursion\u201d, Boston University Research Report, 1989. Part of the results of this paper has been presented in \u201cComputational consequences and partial solutions of a generalized unification problem\u201d, Proc. of IEEE 4-th Symp. Logic in Computer Science pp 98\u2013105, 1989.","DOI":"10.1109\/LICS.1989.39163"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Kfoury, A.J., Tiuryn, J. and Urzyczyn, P., \u201cThe undecidability of the semi-unification problem\u201d, Proc. ACM Symp. Theory of Computing, 1990.","DOI":"10.1145\/100216.100279"},{"key":"8_CR22","unstructured":"Kfoury, A.J., Tiuryn, J. and Urzyczyn, P., \u201cAn analysis of ML typability\u201d, 15-th Colloquium on Trees in Algebra and Programming, CAAP'90, Copenhagen, Springer, 1990."},{"key":"8_CR23","unstructured":"Kfoury, A.J., and Tiuryn, J., \u201cType reconstruction in finite-rank fragments of the second-order \u03bb-calculus\u201d, Proc. 5-th IEEE Symp. Logic in Computer Science, 1990."},{"key":"8_CR24","first-page":"151","volume":"329","author":"H. Lei\u00df","year":"1987","unstructured":"Lei\u00df H., \u201cOn Type Inference for Object-Oriented Programming Languages\u201d, In Proc. 1st Workshop on Computer Science Logic, B\u00f6rger, B\u00fcning and Richter (eds.), LNCS vol.329, pp 151\u2013172, Springer, 1987.","journal-title":"LNCS"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Leivant, D., \u201cPolymorphic type inference\u201d, Proc. 10th ACM Symp. Principles of Programming Languages, 1983.","DOI":"10.1145\/567067.567077"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Leivant, D., \u201cStratified Polymorphism, (Extended Summary),\u201d Proc. 4th IEEE Symp. Logic in Computer Science, pp. 39\u201347, 1989.","DOI":"10.1109\/LICS.1989.39157"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Mairson, H.G. \u201cDeciding ML typability is complete for deterministic exponential time\u201d, Proc. 16-th ACM Symp. Principles of Programming Languages, 1990.","DOI":"10.1145\/96709.96748"},{"key":"8_CR28","first-page":"301","volume":"173","author":"N. McCraken","year":"1984","unstructured":"McCraken, N., \u201cThe typechecking of programs with implicit type structure\u201d, In: Semantics of Data Types, Kahn, MacQueen and Plotkin (eds.), LNCS vol. 173, pp 301\u2013315, Springer, 1984.","journal-title":"LNCS"},{"key":"8_CR29","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. of Computer and System Sciences, Vol. 17, pp 348\u2013375, 1978.","journal-title":"J. of Computer and System Sciences"},{"key":"8_CR30","unstructured":"Milner, R., \u201cThe standard ML core language\u201d, Polymorphism, II (2), October 1985."},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Mitchell, J.C., \u201cCoercion and Type Inference (Summary)\u201d, Proc. 11th ACM Symp. Principles of Programming Languages, pp 175\u2013185, 1984.","DOI":"10.1145\/800017.800529"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Mitchell, J. and Harper, R., \u201cThe essence of ML\u201d, Proc. 15-th ACM Symp. Principles of Prog. Lang., 1988.","DOI":"10.1145\/73560.73563"},{"key":"8_CR33","first-page":"217","volume":"167","author":"A. Mycroft","year":"1984","unstructured":"Mycroft, A., \u201cPolymorphic type schemes and recursive definition,\u201d Int'l Symp. on Programming, Paul and Robinet (eds.), LNCS vol. 167, pp 217\u2013228, Springer, 1984.","journal-title":"LNCS"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Ohori, A., and Buneman, P., \u201cType Inference in a Database Programming Language\u201d, Proc. ACM Conf. Lisp and Functional Programming, pp 174\u2013183, 1988.","DOI":"10.1145\/62678.62700"},{"key":"8_CR35","first-page":"158","volume":"16","author":"M.S. Paterson","year":"1978","unstructured":"Paterson, M.S., Wegman, M.N., \u201cLinear unification\u201d, JCSS, 16, pp 158\u2013167, 1978.","journal-title":"JCSS"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Pfenning, F., \u201cPartial Polymorphic Type Inference and Higher-Order Unification\u201d, Proc. ACM Conference on Lisp and Functional Programming, 1988.","DOI":"10.1145\/62678.62697"},{"issue":"3","key":"8_CR37","first-page":"551","volume":"29","author":"P. Pudl\u00e1k","year":"1988","unstructured":"Pudl\u00e1k, P., \u201cOn a unification problem related to Kreisel's conjecture\u201d, Commentationes Mathematicae Universitatis Carolinae, Prague, Czechoslovakia, 29, no. 3, pp 551\u2013556, 1988.","journal-title":"Prague, Czechoslovakia"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"R\u00e8my, D., \u201cTypechecking records and variants in a natural extension of ML\u201d, Proc. 16th ACM Symp. Principles of Programming Languages, pp. 77\u201387, 1989.","DOI":"10.1145\/75277.75284"},{"key":"8_CR39","first-page":"408","volume":"19","author":"J. Reynolds","year":"1974","unstructured":"Reynolds, J., \u201cTowards a theory of type structure\u201d, In Proc. Programming Symposium, Robinet (ed.), LNCS vol. 19, pp 408\u2013425, Springer, 1974.","journal-title":"LNCS"},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Stansifer, R., \u201cType Inference with Subtypes\u201d, Proc. 15th ACM Symp. Principles of Programming Languages, pp. 88\u201397, 1988.","DOI":"10.1145\/73560.73568"},{"key":"8_CR41","unstructured":"Tyszkiewicz, J., \u201cComplexity of Type Inference in Finitely Typed Lambda Calculus,\u201d MS Thesis, University of Warsaw, 1988."},{"key":"8_CR42","doi-asserted-by":"crossref","unstructured":"Wand, M., and O'Keefe, P. \u201cOn the Complexity of Type Inference with Coercions\u201d, Manuscript 1989.","DOI":"10.1145\/99370.99394"},{"key":"8_CR43","doi-asserted-by":"crossref","unstructured":"Wand, M., \u201cComplete type inference for simple objects\u201d, Proc. 2nd IEEE Symposium on Logic in Computer Science, pp 37\u201344, 1987. See also \u201cCorrigendum: complete type inference for simple types\u201d, Proc. 3rd IEEE Symposium on Logic in Computer Science, p 132, 1988.","DOI":"10.1109\/LICS.1988.5111"},{"key":"8_CR44","doi-asserted-by":"crossref","unstructured":"Wand, M., \u201cType Inference for Record Concatenation and Miultiple Inheritance\u201d, Proc. 4th IEEE Symp. Logic in Computer Science, pp 92\u201397, 1989.","DOI":"10.1109\/LICS.1989.39162"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T01:34:15Z","timestamp":1736127255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/bfb0029599","relation":{},"subject":[]}}