{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:38Z","timestamp":1725490238803},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442332"},{"type":"electronic","value":"9783540457886"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45788-7_11","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T11:04:02Z","timestamp":1188299042000},"page":"183-197","source":"Crossref","is-referenced-by-count":2,"title":["Coinductive Interpreters for Process Calculi"],"prefix":"10.1007","author":[{"given":"Lu\u00eds Soares","family":"Barbosa","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Nuno","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"11_CR1","unstructured":"P. Aczel. Final universes of processes. In Brooks et al, editor, Proc. Math. Foundations of Programming Semantics. Springer Lect. Notes Comp. Sci. (802), 1993. 195"},{"key":"11_CR2","first-page":"47","volume":"44.4","author":"L. S. Barbosa","year":"2001","unstructured":"L. S. Barbosa. Process calculi \u00e0 la Bird-Meertens. In CMCS\u201901 \u2014 Workshop on Coalgebraic Methods in Computer Science, pages 47\u201366, Genova, April 2001. ENTCS, volume 44.4, Elsevier. 184, 195","journal-title":"CMCS\u201901 \u2014 Workshop on Coalgebraic Methods in Computer Science"},{"key":"11_CR3","unstructured":"R. Bird and O. Moor. The Algebra of Programming. Series in Computer Science. Prentice-Hall International, 1997. 183"},{"key":"11_CR4","unstructured":"R. Cockett and T. Fukushima. About Charity. Yellow Series Report No. 92\/480\/18, Dep. Computer Science, University of Calgary, June 1992. 183"},{"key":"11_CR5","unstructured":"R. Cockett and D. Spencer. Strong categorical datatypes I. In R.A.G. Seely, editor, Proceedings of Int. Summer Category Theory Meeting, Montr\u00e9al, Qu\u00e9bec, 23\u201330 June 1991, pages 141\u2013169. AMS, CMS Conf. Proceedings 13, 1992. 185, 193"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"T. Hagino. A typed lambda calculus with categorical type constructors. In D.H. Pitt, A. Poign\u00e9, and D.E. Rydeheard, editors, Category Theory and Computer Science, pages 140\u2013157. Springer Lect. Notes Comp. Sci. (283), 1987. 185","DOI":"10.1007\/3-540-18508-9_24"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"B. Jacobs. Objects and classes, co-algebraically. In C. Lengauer B. Freitag, C.B. Jones and H.-J. Schek, editors, Object-Orientation with Parallelism and Persistence, pages 83\u2013103. Kluwer Academic Publishers, 1996. 185","DOI":"10.1007\/978-1-4613-1437-0_5"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"P. Jansson and J. Jeuring. PolyP-a polytypic programming language extension. In POPL\u201997: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 470\u2013482. ACM Press, 1997. 183","DOI":"10.1145\/263699.263763"},{"key":"11_CR9","unstructured":"R.B. Kieburtz. Codata and comonads in Haskell. Unpublished manuscript, 1998. 185"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01304852","volume":"23","author":"A. Kock","year":"1972","unstructured":"A. Kock. Strong functors and monoidal monads. Archiv f\u00fcr Mathematik, 23:113\u2013120, 1972. 185","journal-title":"Archiv f\u00fcr Mathematik"},{"key":"11_CR11","unstructured":"M. Lenisa. Themes in Final Semantics. PhD thesis, Universita de Pisa-Udine, 1998. 195"},{"issue":"5","key":"11_CR12","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01211391","volume":"4","author":"L. Meertens","year":"1992","unstructured":"L. Meertens. Paramorphisms. Formal Aspects of Computing, 4(5):413\u2013425, 1992. 194","journal-title":"Formal Aspects of Computing"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In J. Hughes, editor, Proceedings of the 1991 ACM Conference on Functional Programming Languages and Computer Architecture, pages 124\u2013144. Springer Lect. Notes Comp. Sci. (523), 1991. 185","DOI":"10.1007\/3540543961_7"},{"key":"11_CR14","unstructured":"R. Milner. Communication and Concurrency. Series in Computer Science. Prentice-Hall International, 1989. 186, 187, 191"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (parts I and II). Information and Computation, 100(1):1\u201377, 1992. 195","journal-title":"Information and Computation"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. Rutten","year":"2000","unstructured":"J. Rutten. Universal coalgebra: A theory of systems. Theor. Comp. Sci., 249(1):3\u201380, 2000. (Revised version of CWI Techn. Rep. CS-R9652, 1996). 184, 185","journal-title":"Theor. Comp. Sci."},{"issue":"5","key":"11_CR17","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1017\/S0960129598002588","volume":"8","author":"D. Turi","year":"1998","unstructured":"D. Turi and J. Rutten. On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces. Mathematical Structures in Computer Science, 8(5):481\u2013540, 1998. 185","journal-title":"Mathematical Structures in Computer Science"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"U. Wolter. A coalgebraic introduction to csp. In II Workshop on Coalgebraic Methods in Computer Science. ENTCS, volume 19, Elsevier, 1999. 195","DOI":"10.1016\/S1571-0661(05)80269-5"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45788-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T00:23:07Z","timestamp":1550881387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45788-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442332","9783540457886"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45788-7_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}