{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:38Z","timestamp":1761611138561,"version":"build-2065373602"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,9,25]],"date-time":"2004-09-25T00:00:00Z","timestamp":1096070400000},"content-version":"vor","delay-in-days":3555,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/s1571-0661(04)80008-2","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T15:29:25Z","timestamp":1096385365000},"page":"132-153","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":38,"special_numbering":"C","title":["Type Inference for Recursively Constrained Types and its Application to OOP"],"prefix":"10.1016","volume":"1","author":[{"given":"Jonathan","family":"Eifrig","sequence":"first","affiliation":[]},{"given":"Scott","family":"Smith","sequence":"additional","affiliation":[]},{"given":"Valery","family":"Trifonov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB1","doi-asserted-by":"crossref","unstructured":"M. Abadi and L. Cardelli. A semantics of object types. In Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science, pages 332\u2013341, 1994.","DOI":"10.1109\/LICS.1994.316056"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB2","unstructured":"A. Aiken. Illyria system. Available by anonymous ftp from ftp:\/\/s2k-ftp.cs.berkeley.edu\/pub\/personal\/aiken\/, 1994."},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB3","doi-asserted-by":"crossref","unstructured":"A. Aiken and E. L. Wimmers. Type inclusion constraints and type inference. In Proceedings of the International Conference on Functional Programming Languages and Computer Architecture, pages 31\u201341, 1993.","DOI":"10.1145\/165180.165188"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB4","doi-asserted-by":"crossref","unstructured":"K. Bruce. Safe type checking in a statically-typed object-oriented programming language. In Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages, pages 285\u2013298, 1993.","DOI":"10.1145\/158511.158650"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB5","unstructured":"Kim B. Bruce and Robert van Gent. TOIL: A new type-safe object-oriented imperative language. Technical report, Williams College, 1993."},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB6","doi-asserted-by":"crossref","unstructured":"P. Canning, W. Cook, W. Hill, J. Mitchell, and W. Olthoff. F-bounded polymorphism for object-oriented programming. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture, pages 273\u2013280, 1989","DOI":"10.1145\/99370.99392"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB7","doi-asserted-by":"crossref","unstructured":"L. Cardelli. A semantics of multiple inheritance. In Semantics of Data Types, volume 173 of Lecture notes in Computer Science, pages 51\u201367. Springer-Verlag, 1984.","DOI":"10.1007\/3-540-13346-1_2"},{"issue":"4","key":"10.1016\/S1571-0661(04)80008-2_NEWBIB8","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1145\/6041.6042","article-title":"On understanding types, data abstraction and polymorphism","volume":"17","author":"Cardelli","year":"1985","journal-title":"Computing Surveys"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB9","unstructured":"William R. Cook, Walter L. Hill, and Peter S. Canning. Inheritance is not subtyping. In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages. ACM Press, 1990."},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB10","unstructured":"J. Eifrig, S. Smith, V. Trifonov, and A. Zwarico. A simple interpretation of OOP in a language with state. Technical Report YALEU\/DCS\/RR-968, Yale University, 1993."},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB11","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/191080.191086","article-title":"Application of OOP type theory: State, decidability, integration","author":"Eifrig","year":"1994","journal-title":"OOPSLA '94"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB12","doi-asserted-by":"crossref","unstructured":"J. Eifrig, S. Smith, V. Trifonov, and A. Zwarico. An interpretation of typed OOP in a language with state. Lisp and Symbolic Computation, 1995. To appear.","DOI":"10.1007\/BF01018829"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB13","doi-asserted-by":"crossref","unstructured":"S. Kaes. Type inference in the presence of overloading, subtyping and recursive types. In ACM Conference on Lisp and Functional Programming, pages 193\u2013204, 1992.","DOI":"10.1145\/141471.141540"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB14","series-title":"Theoretical Aspects of Object-Oriented Programming, chapter 13","first-page":"464","article-title":"Two semantic models of object-oriented languages","author":"Samuel Kamin","year":"1994"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB15","doi-asserted-by":"crossref","unstructured":"D. Kozen, J. Palsberg, and M. I. Schwartzbach. Efficient inference of partial types. In Foundations of Computer Science, 1992.","DOI":"10.7146\/dpb.v21i394.6629"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0019-9958(86)80019-5","article-title":"An ideal model for recursive polymorphic types","volume":"71","author":"MacQueen","year":"1986","journal-title":"Information and Control"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB17","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB18","doi-asserted-by":"crossref","unstructured":"J. Mitchell. Coercion and type inference (summary). In Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984.","DOI":"10.1145\/800017.800529"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB19","unstructured":"N. Oxh\u00f8j, J. Palsberg, and M. I. Schwartzbach. Type inference with subtypes. In ECOOP'92 European Conference on Object-Oriented Programming, volume 615 of Lecture notes in Computer Science, pages 329\u2013349. Springer-Verlag, 1992."},{"year":"1994","series-title":"Object-Oriented Type Systems","author":"Palsberg","key":"10.1016\/S1571-0661(04)80008-2_NEWBIB20"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB21","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(92)90196-3","article-title":"Safety analysis versus type inference for partial types","author":"Palsberg","year":"1992","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB22","doi-asserted-by":"crossref","unstructured":"J. Plevyak and A. Chien. Precise concrete type inference for object-oriented languages. In Proceedings of the Ninth Annual ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 324\u2013340, 1994.","DOI":"10.1145\/191080.191130"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB23","doi-asserted-by":"crossref","unstructured":"Didier R\u00e9my. Programming objects with ML-ART: An extension to ML with abstract and record types. In Masami Hagiya and John C. Mitchell, editors, International Symposium on Theoretical Aspects of Computer Software, pages 321\u2013346, Sendai, Japan, April 1994. Springer-Verlag.","DOI":"10.1007\/3-540-57887-0_102"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB24","doi-asserted-by":"crossref","unstructured":"J. C. Reynolds. Three approaches to type structure. In TAPSOFT proceedings, volume 185 of Lecture notes in Computer Science, pages 97\u2013138, 1985.","DOI":"10.1007\/3-540-15198-2_7"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB25","doi-asserted-by":"crossref","unstructured":"T. Sekiguchi and A. Yonezawa. A complete type inference system for subtyped recursive types. In Proc. Theoretical Aspects of Computer Software, volume 789 of Lecture Notes in Computer Science, pages 667\u2013686. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-57887-0_120"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(90)90018-D","article-title":"Type inference for polymorphic references","volume":"89","author":"Tofte","year":"1990","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80008-2_NEWBIB27","unstructured":"A. Wright and M. Felleisen. A syntactic approach to type soundness. Technical Report TR91\u2013160, Rice University Department of Computer Science, 1991. To appear in Information and Computation."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800082?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800082?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:03:12Z","timestamp":1761609792000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104800082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":27,"alternative-id":["S1571066104800082"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80008-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Type Inference for Recursively Constrained Types and its Application to OOP","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80008-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}