{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:27:44Z","timestamp":1767929264335,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642370359","type":"print"},{"value":"9783642370366","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37036-6_4","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T14:35:55Z","timestamp":1361198155000},"page":"61-80","source":"Crossref","is-referenced-by-count":8,"title":["Language Constructs for Non-Well-Founded Computation"],"prefix":"10.1007","author":[{"given":"Jean-Baptiste","family":"Jeannin","sequence":"first","affiliation":[]},{"given":"Dexter","family":"Kozen","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1051\/ita:2007028","volume":"41","author":"J. Ad\u00e1mek","year":"2007","unstructured":"Ad\u00e1mek, J., L\u00fccke, D., Milius, S.: Recursive coalgebras of finitary functors. Theoretical Informatics and Applications\u00a041, 447\u2013462 (2007)","journal-title":"Theoretical Informatics and Applications"},{"issue":"5:4","key":"4_CR2","first-page":"1","volume":"2","author":"J. Ad\u00e1mek","year":"2006","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: Elgot algebras. Log. Methods Comput. Sci.\u00a02(5:4), 1\u201331 (2006)","journal-title":"Log. Methods Comput. Sci."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-10452-7_7","volume-title":"Formal Methods: Foundations and Applications","author":"V. Capretta","year":"2009","unstructured":"Capretta, V., Uustalu, T., Vene, V.: Corecursive Algebras: A Study of General Structured Corecursion. In: Oliveira, M.V.M., Woodcock, J. (eds.) SBMF 2009. LNCS, vol.\u00a05902, pp. 84\u2013100. Springer, Heidelberg (2009)"},{"key":"4_CR4","unstructured":"Chong, S.: Lecture notes on abstract interpretation. Harvard University (2010), http:\/\/www.seas.harvard.edu\/courses\/cs152\/2010sp\/lectures\/lec20.pdf"},{"key":"4_CR5","unstructured":"CoCaml project (December 2012), http:\/\/www.cs.cornell.edu\/Projects\/CoCaml\/"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1145\/512950.512973","volume-title":"4th ACM SIGPLAN-SIGACT Symp. Principles of Programming Languages","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: 4th ACM SIGPLAN-SIGACT Symp. Principles of Programming Languages, pp. 238\u2013252. ACM Press, New York (1977)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/11799573_25","volume-title":"Logic Programming","author":"L. Simon","year":"2006","unstructured":"Simon, L., Mallya, A., Bansal, A., Gupta, G.: Coinductive Logic Programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 330\u2013345. Springer, Heidelberg (2006)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-540-73420-8_42","volume-title":"Automata, Languages and Programming","author":"L. Simon","year":"2007","unstructured":"Simon, L., Bansal, A., Mallya, A., Gupta, G.: Co-Logic Programming: Extending Logic Programming with Coinduction. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 472\u2013483. Springer, Heidelberg (2007)"},{"key":"4_CR9","unstructured":"Taylor, P.: Practical Foundations of Mathematics. Cambridge Studies in Advanced Mathematics, vol.\u00a059. Cambridge University Press (1999)"},{"key":"4_CR10","unstructured":"y Widemann, B.T.: Coalgebraic semantics of recursion on circular data structures. In: Cirstea, C., Seisenberger, M., Wilkinson, T. (eds.) CALCO Young Researchers Workshop (CALCO-jnr 2011), pp. 28\u201342 (August 2011)"},{"key":"4_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages: An Introduction","author":"G. Winskel","year":"1993","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages: An Introduction. MIT Press, Cambridge (1993)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37036-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T08:35:40Z","timestamp":1595406940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37036-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370359","9783642370366"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37036-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}