{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300539},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578871"},{"type":"electronic","value":"9783540483830"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57887-0_120","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:39:12Z","timestamp":1330263552000},"page":"667-686","source":"Crossref","is-referenced-by-count":3,"title":["A complete type inference system for subtyped recursive types"],"prefix":"10.1007","author":[{"given":"Tatsurou","family":"Sekiguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akinori","family":"Yonezawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Robert M. Amadio and Luca Cardelli. Subtyping Recursive Types. In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 104\u2013118, January 1991.","DOI":"10.1145\/99583.99600"},{"key":"34_CR2","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/155183.155231","volume":"15","author":"R. M. Amadio","year":"1993","unstructured":"Robert M. Amadio and Luca Cardelli. Subtyping Recursive Types. In ACM Transactions on Programming Languages and Systems, volume 15, pages 575\u2013631, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"34_CR3","unstructured":"Gerald Baumgartner and Vincent F. Russo. Signatures: A C++ Extension for Type Abstraction and Subtype Polymorphism. Technical report, Purdue University, 1993. CSD-TR-03-059."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Kim Bruce and John C. Mitchell. PER models of subtyping, recursive types and higher-order polymorphism. In Conference Record of the Nineteenth Annual ACM Symposium on Principles of Programming Languages, pages 316\u2013327, January 1992.","DOI":"10.1145\/143165.143230"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Peter Canning, William Cook, Walter Hill, and Walter Olthoff. F-Bounded Polymorphism for Object-Oriented Programming. In The Fourth International Conference on Functional Programming Languages and Computer Architecture, pages 273\u2013280, September 1989.","DOI":"10.1145\/99370.99392"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Luca Cardelli. A Semantics of Multiple Inheritance. In D.B. MacQueen G. Kahn and G. Plotkin, editors, 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"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Luca Cardelli and Peter Wegner. On Understanding Types, Data Abstraction, and Polymorphism. In Computing Surveys, volume 17, 1985.","DOI":"10.1145\/6041.6042"},{"key":"34_CR8","series-title":"APIC Studies in Data Processing","first-page":"231","volume-title":"Logic Programming","author":"A. Colmerauer","year":"1982","unstructured":"Alain Colmerauer. Prolog and Infinite Trees. In K. L. Clark and S.-A. T\u00e4rnlund, editors, Logic Programming, number 16 in APIC Studies in Data Processing, pages 231\u2013251. Academic Press, New York, 1982."},{"key":"34_CR9","unstructured":"Alain Colmerauer. Equations and Inequations on Finite and Infinite Trees. In Proceedings of the International Conference of Fifth Generation Computer Systems, pages 85\u201399, Tokyo, 1984."},{"key":"34_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"Bruno Courcelle. Fundamental Properties of Infinite Trees. In Theoretical Computer Science, volume 25, pages 95\u2013169, March 1983.","journal-title":"Theoretical Computer Science"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Stefan Kaes. Type Inference in the Presence of Overloading, Subtyping and Recursive Types. In Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, pages 193\u2013204, 1992.","DOI":"10.1145\/141471.141540"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Dexter Kozen, Jens Palsberg, and Michael I. Schwartzbach. Efficient Recursive Subtyping. In Conference Record of the Twentieth Annual ACM Symposium on Principle of Programming Languages, 1993.","DOI":"10.1145\/158511.158700"},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0019-9958(86)80019-5","volume":"71","author":"D. MacQueen","year":"1986","unstructured":"David MacQueen, Gordon Plotkin, and Ravi Sethi. An Ideal Model for Recursive Polymorphic Types. In Information and Control, volume 71, pages 95\u2013130, 1986.","journal-title":"Information and Control"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"John C. Mitchell. Coercion and Type Inference. In Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, pages 175\u2013185, 1984.","DOI":"10.1145\/800017.800529"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Nicholas Oxh\u00f8j, Jens Palsberg, and Michael I. Schwartzbach. Making Type Inference Practical. In ECOOP'92 European Conference on Object-Oriented Programming, volume 615 of Lecture Notes in Computer Science, pages 329\u2013349. Springer-Verlag, 1992.","DOI":"10.1007\/BFb0053045"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Ryan Stansifer. Type Inference with Subtypes. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 88\u201397, 1988.","DOI":"10.1145\/73560.73568"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Satish Thatte. Type Inference with Partial Types. In Proceedings of International Colloquium on Automata, Languages, and Programming, volume 317 of Lecture Notes in Computer Science, pages 615\u2013629. Springer-Verlag, 1988.","DOI":"10.1007\/3-540-19488-6_146"},{"key":"34_CR18","unstructured":"Mitchell Wand. Complete Type Inference for Simple Objects. In Proceedings of Second Symposium on Logic in Computer Science, pages 37\u201344, 1987."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57887-0_120.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:32Z","timestamp":1605647732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57887-0_120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578871","9783540483830"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-57887-0_120","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}