{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:45Z","timestamp":1725558645570},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202165"},{"type":"electronic","value":"9783540452089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45208-9_20","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:49:20Z","timestamp":1277686160000},"page":"242-255","source":"Crossref","is-referenced-by-count":0,"title":["Decidability Properties of Recursive Types"],"prefix":"10.1007","author":[{"given":"Felice","family":"Cardone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Coppo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8598-9","volume-title":"A Theory of Objects","author":"M. Abadi","year":"1996","unstructured":"Abadi, M., Cardelli, L.: A Theory of Objects. Springer, Heidelberg (1996)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0019-9958(86)80019-5","volume":"71","author":"D. MacQueen","year":"1986","unstructured":"MacQueen, D., Plotkin, G., Sethi, R.: An ideal model for recursive polymorphic types. Information and Control\u00a071, 95\u2013130 (1986)","journal-title":"Information and Control"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0890-5401(91)90020-3","volume":"92","author":"F. Cardone","year":"1991","unstructured":"Cardone, F., Coppo, M.: Type inference with recursive types. Syntax and Semantics. Information and Computation\u00a092, 48\u201380 (1991)","journal-title":"Syntax and Semantics. Information and Computation"},{"key":"20_CR4","volume-title":"Proceedings Eighth Symposium on Logic in Computer Science","author":"M. Fiore","year":"1993","unstructured":"Fiore, M.: A coinduction principle for recursive data types based on bisimulation. In: Proceedings Eighth Symposium on Logic in Computer Science, IEEE, Los Alamitos (1993)"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theoretical Computer Science\u00a0249, 3\u201380 (2000)","journal-title":"Theoretical Computer Science"},{"key":"20_CR6","volume-title":"The Implementation of Functional Programming Languages","author":"S. Jones","year":"1987","unstructured":"Jones, S.: The Implementation of Functional Programming Languages. Prentice-Hall, Englewood Cliffs (1987)"},{"key":"20_CR7","unstructured":"Statman, R.: Recursive types and the subject reduction theorem. Technical Report 94\u2013164, Carnegie Mellon University (1994)"},{"issue":"12","key":"20_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1008648420750","volume":"7","author":"M. Marz","year":"1999","unstructured":"Marz, M.: An algebraic view on recursive types. Applied Categorical Structures\u00a07(12), 147\u2013157 (1999)","journal-title":"Applied Categorical Structures"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-45315-6_12","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Coppo","year":"2001","unstructured":"Coppo, M.: Type inference with recursive type equations. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 184\u2013198. Springer, Heidelberg (2001)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","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":"Brandt, M., Henglein, F.: Coinductive axiomatization of recursive type equality and subtyping. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol.\u00a01210, pp. 63\u201381. Springer, Heidelberg (1997)"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","volume":"26","author":"Z. Ariola","year":"1996","unstructured":"Ariola, Z., Klop, J.: Equational term graph rewriting. Fundamenta Informaticae\u00a026, 207\u2013240 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","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":"Scott, D.: Some philosophical issues concerning theories of combinators. In: B\u00f6hm, C. (ed.) Lambda-Calculus and Computer Science Theory. LNCS, vol.\u00a037, pp. 346\u2013366. Springer, Heidelberg (1975)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","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":"Breazu-Tannen, V., Meyer, A.: Lambda calculus with constrained types. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.\u00a0193, pp. 23\u201340. Springer, Heidelberg (1985)"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"Milner, R.: A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences\u00a017, 348\u2013375 (1978)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science\u00a025, 95\u2013169 (1983)","journal-title":"Theoretical Computer Science"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-662-21545-6_14","volume-title":"Automata, Languages and Programming","author":"B. Courcelle","year":"1974","unstructured":"Courcelle, B., Kahn, G., Vuillemin, J.: Algorithmes d\u2019\u00e9quivalence et de r\u00e9duction \u00e0 des expressions minimales, dans une classe d\u2019\u00e9quations r\u00e9cursives simples. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol.\u00a014, pp. 200\u2013213. Springer, Heidelberg (1974)"},{"key":"20_CR17","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"J. Klop","year":"1992","unstructured":"Klop, J.: Term rewriting systems. In: Abramsky, S., Gabby, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, pp. 1\u2013116. Oxford University Press, New York (1992)"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","volume":"121","author":"J.W. Klop","year":"1993","unstructured":"Klop, J.W., van Oostrom, V., van Raamsdonk, F.: Combinatory reduction systems: Introduction and survey. Theoretical Computer Science\u00a0121, 279\u2013308 (1993)","journal-title":"Theoretical Computer Science"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1016\/S0304-3975(01)00298-5","volume":"275","author":"F. Cardone","year":"2002","unstructured":"Cardone, F.: A coinductive completeness proof for the equivalence of recursive types. Theoretical Computer Science\u00a0275, 575\u2013587 (2002)","journal-title":"Theoretical Computer Science"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1017\/S0960129598002588","volume":"8","author":"D. Turi","year":"1998","unstructured":"Turi, D., Rutten, J.: On the foundations of final semantics: Non-standard sets, metric spaces, partial orders. Mathematical Structures in Computer Science\u00a08, 481\u2013540 (1998)","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45208-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T01:44:37Z","timestamp":1591407877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45208-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202165","9783540452089"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45208-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}