{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:10Z","timestamp":1725663730472},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552512"},{"type":"electronic","value":"9783540467991"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55251-0_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T04:56:10Z","timestamp":1330232170000},"page":"66-85","source":"Crossref","is-referenced-by-count":0,"title":["An algebraic approach to the interpretation of recursive types"],"prefix":"10.1007","author":[{"given":"Felice","family":"Cardone","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and G.D. Plotkin. A per model of polymorphism and recursive types. In Proc. Symposium on Logic and Computer Science, pages 355\u2013365. IEEE, 1990.","DOI":"10.1109\/LICS.1990.113761"},{"issue":"1","key":"4_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90074-C","volume":"91","author":"R. Amadio","year":"1991","unstructured":"R. Amadio. Recursion over realizability structures. Information and Computation, 91(1):55\u201385, 1991.","journal-title":"Information and Computation"},{"key":"4_CR3","volume-title":"Technical Report CS-R8733","author":"J. A. Bergstra","year":"1987","unstructured":"J.A. Bergstra and J.W. Klop. A convergence theorem in process algebra. Technical Report CS-R8733, CWI, Amsterdam, 1987."},{"issue":"1","key":"4_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0209002","volume":"9","author":"S. L. Bloom","year":"1980","unstructured":"S.L. Bloom, C.C. Elgot, and J.B. Wright. Solutions of the iteration equation and extensions of the scalar iteration operation. SIAM Journal on Computing, 9(1):25\u201345, 1980.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"4_CR5","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/0209039","volume":"9","author":"S. L. Bloom","year":"1980","unstructured":"S.L. Bloom, C.C. Elgot, and J.B. Wright. Vector iteration in pointed iterative theories. SIAM Journal on Computing, 9(3):525\u2013540, 1980.","journal-title":"SIAM Journal on Computing"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"K. Bruce and G. Longo. A modest model of records, inheritance and bounded quantification. In Proc. Symposium on Logic and Computer Science, pages 38\u201350. IEEE, 1988.","DOI":"10.1109\/LICS.1988.5099"},{"key":"4_CR7","unstructured":"K. Bruce and J.C. Mitchell. PER models of subtyping recursive types and higher-order polymorphism. 1991. To appear, POPL 1992."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0890-5401(88)90007-7","volume":"76","author":"L. Cardelli","year":"1988","unstructured":"L. Cardelli. A semantics of multiple inheritance. Information and Computation, 76:138\u2013164, 1988.","journal-title":"Information and Computation"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1145\/6041.6042","volume":"17","author":"L. Cardelli","year":"1985","unstructured":"L. Cardelli and P. Wegner. On understanding types, data abstraction and polymorphism. ACM Computing Surveys, 17:471\u2013522, 1985.","journal-title":"ACM Computing Surveys"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0304-3975(91)90038-4","volume":"83","author":"F. Cardone","year":"1991","unstructured":"F. Cardone. Recursive types for Fun. Theoretical Computer Science, 83:29\u201356, 1991.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"4_CR11","doi-asserted-by":"crossref","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":"4_CR12","doi-asserted-by":"crossref","unstructured":"M. Coppo. A completeness theorem for recursively defined types. In W. Brauer, editor, Proc. 12th International Colloquium on Automata, Languages and Programming, LNCS 194, pages 120\u2013129. Springer, 1985.","DOI":"10.1007\/BFb0015737"},{"key":"4_CR13","doi-asserted-by":"crossref","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":"4_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/3-540-50325-0_2","volume":"332","author":"H. Ehrig","year":"1988","unstructured":"H. Ehrig, F. Parisi-Presicce, P. Boehm, C. Rieckhoff, C. Dimitrovici, and M. Grosse-Rhode. Algebraic data type and process specification based on projection spaces. In Recent trends in data type specification, LNCS 332, pages 23\u201343. Springer, 1988.","journal-title":"Recent trends in data type specification, LNCS"},{"key":"4_CR15","first-page":"175","volume-title":"Logic Colloquium 73","author":"C. C. Elgot","year":"1975","unstructured":"C.C. Elgot. Monadic computation and iterative algebraic theories. In H.E. Rose and J.C. Shepherdson, editors, Logic Colloquium 73, pages 175\u2013318, Amsterdam, 1975. North Holland."},{"issue":"3","key":"4_CR16","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(78)90024-7","volume":"16","author":"C. C. Elgot","year":"1978","unstructured":"C.C. Elgot, S.L. Bloom, and R. Tindell. The algebraic structure of rooted trees. Journal of Computer and System Sciences, 16(3):362\u2013399, 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR17","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. Goguen","year":"1977","unstructured":"J. Goguen, J.W. Thatcher, E.G. Wagner, and J.B. Wright. Initial algebra semantics and continuous algebras. Journal of the ACM, 24:68\u201395, 1977.","journal-title":"Journal of the ACM"},{"key":"4_CR18","first-page":"301","volume":"430","author":"M. Grosse-Rhode","year":"1989","unstructured":"M. Grosse-Rhode and H. Ehrig. Transformation of combined data type and process specifications using projection algebras. In Stepwise refinement of distributed systems, LNCS 430, pages 301\u2013339. Springer, 1989.","journal-title":"Stepwise refinement of distributed systems, LNCS"},{"key":"4_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(87)90048-4","volume":"72","author":"C. Gunter","year":"1987","unstructured":"C. Gunter. Universal profinite domains. Information and Computation, 72:1\u201330, 1987.","journal-title":"Information and Computation"},{"key":"4_CR20","first-page":"633","volume-title":"Handbook of Theoretical Computer Science, Volume B","author":"C. A. Gunter","year":"1990","unstructured":"C.A. Gunter and D.S. Scott. Semantic domains. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B, pages 633\u2013674, Amsterdam, 1990. North Holland."},{"issue":"1\/2","key":"4_CR21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0019-9958(86)80019-5","volume":"71","author":"D. MacQueen","year":"1986","unstructured":"D. MacQueen, G.D. Plotkin, and R. Sethi. An ideal model for recursive polymorphic types. Information and Control, 71((1\/2)):95\u2013130, 1986.","journal-title":"Information and Control"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"A.R. Meyer. Semantical paradigms: Notes for an invited lecture, with two appendices by Stavros S. Cosmadakis. In 3rd Symposium on Logic in Computer Science, pages 236\u2013255. IEEE, 1988.","DOI":"10.21236\/ADA202995"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"J.C. Mitchell. A type inference approach to reduction properties and semantics of polymorphic expressions. In Proc. ACM Conference on LISP and Functional Programming, pages 308\u2013319, 1986.","DOI":"10.1145\/319838.319872"},{"key":"4_CR24","volume-title":"Lecture notes","author":"D. S. Scott","year":"1980","unstructured":"D.S. Scott. Lectures on a mathematical theory of computation. Lecture notes, Merton College, Oxford, Michaelmas Term, 1980."},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"M. Smyth","year":"1982","unstructured":"M. Smyth and G.D. Plotkin. The category-theoretic solution of recursive domain equations. SIAM Journal of Computing, 11:761\u2013783, 1982.","journal-title":"SIAM Journal of Computing"},{"key":"4_CR26","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0304-3975(80)90056-0","volume":"12","author":"J. Tiuryn","year":"1980","unstructured":"J. Tiuryn. Unique fixed points vs. least fixed points. Theoretical Computer Science, 12:229\u2013254, 1980.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","CAAP '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55251-0_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:58:21Z","timestamp":1605628701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55251-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552512","9783540467991"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-55251-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}