{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:42:38Z","timestamp":1725496958894},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418641"},{"type":"electronic","value":"9783540453154"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45315-6_12","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T01:28:39Z","timestamp":1196645319000},"page":"184-198","source":"Crossref","is-referenced-by-count":5,"title":["Type Inference with Recursive Type Equations"],"prefix":"10.1007","author":[{"given":"Mario","family":"Coppo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"12_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/3-540-62688-3_29","volume-title":"Typed Lambda Calculi and Applications","author":"M. Brandt","year":"1997","unstructured":"M. Brandt and F. Henglein. Coinductive axiomatization of recursive type equality and subtyping. In P. de Groote and J. R. Hindley, editors, Typed Lambda Calculi and Applications, volume 1210 of Lecture Notes in Computer Science, pages 63\u201381. Springer-Verlag, 1997."},{"key":"12_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/3-540-15648-8_3","volume-title":"Logics of Programs","author":"V. Breazu-Tannen","year":"1985","unstructured":"V. Breazu-Tannen and A. Meyer. Lambda calculus with constrained types. In R. Parikh, editor, Logics of Programs, volume 193 of Lecture Notes in Computer Science, pages 23\u201340. Springer-Verlag, 1985."},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0890-5401(91)90020-3","volume":"92","author":"F. Cardone","year":"1991","unstructured":"F. Cardone and M. Coppo. Type inference with recursive types. Syntax and Semantics. Information and Computation, 92(1):48\u201380, 1991.","journal-title":"Information and Computation"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95\u2013169, 1983.","journal-title":"Theoretical Computer Science"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.2307\/1995158","volume":"146","author":"J.R. Hindley","year":"1969","unstructured":"J.R. Hindley. The principal type scheme of an object in combinatory logic. Transactions of the American Mathematical Society, 146:29\u201360, 1969.","journal-title":"Transactions of the American Mathematical Society"},{"key":"12_CR6","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"J.W. Klop","year":"1992","unstructured":"J.W. Klop. Term rewriting systems. In Dov M. Gabbay S. Abramsky and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, pages 1\u2013116. Oxford University Uress, New York, 1992."},{"issue":"12","key":"12_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1008648420750","volume":"7","author":"M. Marz","year":"1999","unstructured":"M. Marz. An algebraic view on recursive types. Applied Categorical Structures, 7(12):147\u2013157, 1999.","journal-title":"Applied Categorical Structures"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A Theory of Type Polimorphism in Programming. Journal of Computer and System Sciences, 17:348\u2013375, 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR9","unstructured":"R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, 1990."},{"key":"12_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/BFb0029537","volume-title":"Lambda calculus and computer science theory","author":"D. Scott","year":"1975","unstructured":"D. Scott. Some philosophical issues concerning theories of combinators. In C. Bohm, editor, Lambda calculus and computer science theory, volume 37 of Lecture Notes in Computer Science, pages 346\u2013366. Springer-Verlag, 1975."},{"key":"12_CR11","unstructured":"R. Statman. Recursive types and the subject reduction theorem. Technical Report 94-164, Carnegie Mellon University, 1994."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"B. Pierce V. Gapeyev, M. Levin. Recursive subtyping revealed. In Proceedings fifth ACM SIGPLAN International Conference on Functional Programming, pages 221\u2013232. ACM press, 2000.","DOI":"10.1145\/357766.351261"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45315-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T09:10:08Z","timestamp":1557047408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45315-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418641","9783540453154"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45315-6_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}