{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:07Z","timestamp":1725549187738},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120312"},{"type":"electronic","value":"9783642120329"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_22","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T01:07:56Z","timestamp":1268010476000},"page":"312-327","source":"Crossref","is-referenced-by-count":0,"title":["CIA Structures and the Semantics of Recursion"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Milius","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence S.","family":"Moss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Schwencke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","volume-title":"Handbook of Process Algebra","author":"L. Aceto","year":"2001","unstructured":"Aceto, L., Fokking, W., Verhoef, C.: Structural Operational Semantics. In: Handbook of Process Algebra. Elsevier, Amsterdam (2001)"},{"key":"22_CR2","series-title":"CLSI Lecture Notes","volume-title":"Non-Well-Founded Sets","author":"P. Aczel","year":"1988","unstructured":"Aczel, P.: Non-Well-Founded Sets. CLSI Lecture Notes, vol.\u00a014. CLSI Publications, Stanford (1988)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00728-4","volume":"300","author":"P. Aczel","year":"2003","unstructured":"Aczel, P., Ad\u00e1mek, J., Milius, S., Velebil, J.: Infinite trees and completely iterative theories: A coalgebraic view. Theoret.\u00a0Comput.\u00a0Sci.\u00a0300, 1\u201345 (2003)","journal-title":"Theoret.\u00a0Comput.\u00a0Sci."},{"key":"22_CR4","first-page":"589","volume":"15","author":"J. Ad\u00e1mek","year":"1974","unstructured":"Ad\u00e1mek, J.: Free algebras and automata realizations in the language of categories. Comment.\u00a0Math.\u00a0Univ.\u00a0Carolin.\u00a015, 589\u2013602 (1974)","journal-title":"Comment.\u00a0Math.\u00a0Univ.\u00a0Carolin."},{"key":"22_CR5","first-page":"157","volume":"14","author":"J. Ad\u00e1mek","year":"2005","unstructured":"Ad\u00e1mek, J.: Introduction to coalgebra. Theory Appl.\u00a0Categ.\u00a014, 157\u2013199 (2005)","journal-title":"Theory Appl.\u00a0Categ."},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2003.12.022","volume":"316","author":"J. Ad\u00e1mek","year":"2004","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: On coalgebras based on classes. Theoret.\u00a0Comput.\u00a0Sci.\u00a0316, 3\u201323 (2004)","journal-title":"Theoret.\u00a0Comput.\u00a0Sci."},{"issue":"5:4","key":"22_CR7","first-page":"31","volume":"2","author":"J. Ad\u00e1mek","year":"2006","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: Elgot algebras. Log.\u00a0Methods\u00a0Comput.\u00a0Sci.\u00a02(5:4), 31 (2006)","journal-title":"Log.\u00a0Methods\u00a0Comput.\u00a0Sci."},{"issue":"2","key":"22_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1017\/S0960129502003900","volume":"13","author":"F. Bartels","year":"2003","unstructured":"Bartels, F.: Generalized coinduction. Math.\u00a0Structures Comput.\u00a0Sci.\u00a013(2), 321\u2013348 (2003)","journal-title":"Math.\u00a0Structures Comput.\u00a0Sci."},{"key":"22_CR9","unstructured":"Bartels, F.: On generalized coinduction and probabilistic specification formats. PhD thesis, Vrije Universiteit Amsterdam (2004)"},{"key":"22_CR10","volume-title":"Vicious circles","author":"J. Barwise","year":"1996","unstructured":"Barwise, J., Moss, L.S.: Vicious circles. CLSI Publications, Stanford (1996)"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.ic.2005.08.005","volume":"204","author":"V. Capretta","year":"2006","unstructured":"Capretta, V., Uustalu, T., Vene, V.: Recursive coalgebras from comonads. Inform. and Comput.\u00a0204, 437\u2013468 (2006)","journal-title":"Inform. and Comput."},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11780274_20","volume-title":"Algebra, Meaning, and Computation","author":"B. Jacobs","year":"2006","unstructured":"Jacobs, B.: A bialgebraic review of deterministic automata, regular expressions and languages. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol.\u00a04060, pp. 375\u2013404. Springer, Heidelberg (2006)"},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.ic.2005.03.006","volume":"204","author":"B. Jacobs","year":"2006","unstructured":"Jacobs, B.: Distributive laws for the coinductive solution of recursive equations. Inform.\u00a0and Comput.\u00a0204(4), 561\u2013587 (2006)","journal-title":"Inform.\u00a0and Comput."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01110627","volume":"103","author":"J. Lambek","year":"1968","unstructured":"Lambek, J.: A fixpoint theorem for complete categories. Math.\u00a0Z.\u00a0103, 151\u2013161 (1968)","journal-title":"Math.\u00a0Z."},{"key":"22_CR15","series-title":"Electron.\u00a0Notes Theor.\u00a0Comput.\u00a0Sci.","volume-title":"Proc.\u00a0Coalgebraic Methods in Computer Science","author":"M. Lenisa","year":"2000","unstructured":"Lenisa, M., Power, A.J., Watanabe, H.: Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. In: Reichel, H. (ed.) Proc.\u00a0Coalgebraic Methods in Computer Science. Electron.\u00a0Notes Theor.\u00a0Comput.\u00a0Sci., vol.\u00a033. Elsevier, Amsterdam (2000)"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2004.07.024","volume":"327","author":"M. Lenisa","year":"2004","unstructured":"Lenisa, M., Power, A.J., Watanabe, H.: Category theory for operational semantics. Theoret.\u00a0Comput.\u00a0Sci.\u00a0327, 135\u2013154 (2004)","journal-title":"Theoret.\u00a0Comput.\u00a0Sci."},{"key":"22_CR17","volume-title":"Categories for the working mathematician","author":"S. MacLane","year":"1998","unstructured":"MacLane, S.: Categories for the working mathematician, 2nd edn. Springer, Heidelberg (1998)","edition":"2"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.05.003","volume":"196","author":"S. Milius","year":"2005","unstructured":"Milius, S.: Completely iterative algebras and completely iterative monads. Inform.\u00a0and Comput.\u00a0196, 1\u201341 (2005)","journal-title":"Inform.\u00a0and Comput."},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2006.07.002","volume":"366","author":"S. Milius","year":"2006","unstructured":"Milius, S., Moss, L.S.: The category theoretic solution of recursive program schemes. Theoret.\u00a0Comput.\u00a0Sci.\u00a0366, 3\u201359 (2006) (fundamental study)","journal-title":"Theoret.\u00a0Comput.\u00a0Sci."},{"key":"22_CR20","first-page":"23","volume":"50","author":"S. Milius","year":"2009","unstructured":"Milius, S., Moss, L.S.: Equational properties of recursive program scheme solutions. Cah.\u00a0Topol.\u00a0G\u00e8om.\u00a0Diff\u00e8r.\u00a0Cat\u00e8g.\u00a050, 23\u201366 (2009)","journal-title":"Cah.\u00a0Topol.\u00a0G\u00e8om.\u00a0Diff\u00e8r.\u00a0Cat\u00e8g."},{"key":"22_CR21","series-title":"International Series in Computer Science","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989)"},{"key":"22_CR22","unstructured":"Plotkin, G.D., Turi, D.: Towards a mathematical operational semantics. In: Proc.\u00a0Logic in Computer Science, LICS (1997)"},{"issue":"1","key":"22_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoret.\u00a0Comput.\u00a0Sci.\u00a0249(1), 3\u201380 (2000)","journal-title":"Theoret.\u00a0Comput.\u00a0Sci."},{"issue":"1","key":"22_CR24","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1017\/S0960129504004517","volume":"15","author":"J.J.M.M. Rutten","year":"2005","unstructured":"Rutten, J.J.M.M.: A coinductive calculus of streams. Math.\u00a0Structures Comput.\u00a0Sci.\u00a015(1), 93\u2013147 (2005)","journal-title":"Math.\u00a0Structures Comput.\u00a0Sci."},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Schwencke, D.: Coequational logic for accessible functors. Accepted for publication in Inform.\u00a0and\u00a0Comput. (2009)","DOI":"10.1016\/j.ic.2009.10.010"},{"issue":"3","key":"22_CR26","first-page":"366","volume":"8","author":"T. Uustalu","year":"2001","unstructured":"Uustalu, T., Vene, V., Pardo, A.: Recursion schemes from comonads. Nordic J.\u00a0Comput.\u00a08(3), 366\u2013390 (2001)","journal-title":"Nordic J.\u00a0Comput."},{"key":"22_CR27","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.tcs.2004.12.009","volume":"338","author":"J. Worrell","year":"2005","unstructured":"Worrell, J.: On the final sequence of a finitary set functor. Theoret.\u00a0Comput.\u00a0Sci.\u00a0338, 184\u2013199 (2005)","journal-title":"Theoret.\u00a0Comput.\u00a0Sci."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12032-9_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T19:56:53Z","timestamp":1685476613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}