{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299693},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565963"},{"type":"electronic","value":"9783540475958"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56596-5_45","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:18:10Z","timestamp":1330255090000},"page":"477-530","source":"Crossref","is-referenced-by-count":25,"title":["On the foundations of final semantics: Non-standard sets, metric spaces, partial orders"],"prefix":"10.1007","author":[{"given":"Jan J. M. M.","family":"Rutten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Turi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"20_CR1","volume-title":"A Cook's tour of the finitary non-well-founded sets","author":"S. Abramsky","year":"1988","unstructured":"S. Abramsky. A Cook's tour of the finitary non-well-founded sets. Department of Computing, Imperial College, London, 1988."},{"key":"20_CR2","unstructured":"S. Abramsky. The lazy lambda calculus. In D.A. Turner, editor, Research Topics in Functional Programming, pages 65\u2013116. Addison-Wesley, 1990."},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/inco.1991.9999","volume":"92","author":"S. Abramsky","year":"1991","unstructured":"S. Abramsky. A domain equation for bisimulation. Information and Computation, 92:161\u2013218, 1991.","journal-title":"Information and Computation"},{"key":"20_CR4","unstructured":"P. Aczel. Non-well-founded sets. Number 14 in Lecture Notes. CSLI, 1988."},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0022-0000(79)90026-6","volume":"19","author":"J. Ad\u00e1mek","year":"1979","unstructured":"J. Ad\u00e1mek and V. Koubek. Least fixed point of a functor. Jour. of Computer and System Sciences, 19:163\u2013178, 1979.","journal-title":"Jour. of Computer and System Sciences"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"P. Aczel and N. Mendler. A final coalgebra theorem. In D.H. Pitt, D.E. Ryeheard, P. Dybjer, A.M. Pitts, and A. Poign\u00e9, editors, Proceedings category theory and computer science, Lecture Notes in Computer Science, pages 357\u2013365, 1989.","DOI":"10.1007\/BFb0018361"},{"issue":"3","key":"20_CR7","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0022-0000(89)90027-5","volume":"39","author":"P. America","year":"1989","unstructured":"P. America and J.J.M.M. Rutten. Solving reflexive domain equations in a category of complete metric spaces. Journal of Computer and System Sciences, 39(3):343\u2013375, 1989.","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR8","volume-title":"Perspectives in Mathematical Logic","author":"J. Barwise","year":"1975","unstructured":"J. Barwise. Admisible Sets and Structures. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1975."},{"key":"20_CR9","unstructured":"M. Barr. Terminal coalgebras in well-founded set theory. Department of Mathematics and Statistics, McGill University, 1991."},{"key":"20_CR10","unstructured":"J. Barwise and J. Etchemendy. The Liar: An Essay in Truth and Circularity. Oxford University Press, 1988."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"S. Brookes and S. Geva. Computational comonads and intensional semantics. Technical Report CMU-CS-91-190, Computer Science Department, CarnagieMellon University, 1991.","DOI":"10.1017\/CBO9780511525902.003"},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1007\/BF01941131","volume":"28","author":"J.W. Bakker de","year":"1988","unstructured":"J.W. de Bakker and J.-J.Ch. Meyer. Metric semantics for concurrency. BIT, 28:504\u2013529, 1988.","journal-title":"BIT"},{"key":"20_CR13","unstructured":"F. van Breugel. Generalised finiteness conditions on labelled transition systems for operational semantics of programming languages. CWI, 1992."},{"key":"20_CR14","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","volume":"54","author":"J.W. Bakker de","year":"1982","unstructured":"J.W. de Bakker and J.I. Zucker. Processes and the denotational semantics of concurrency. Information and Control, 54:70\u2013120, 1982.","journal-title":"Information and Control"},{"key":"20_CR15","unstructured":"J. Dugundji. Topology. Allyn and Bacon, inc., 1966."},{"issue":"3","key":"20_CR16","first-page":"493","volume":"X","author":"M. Forti","year":"1983","unstructured":"M. Forti and F. Honsell. Set theory with free construction principles. Annali Scuola Normale Superiore, Pisa, X(3):493\u2013522, 1983.","journal-title":"Annali Scuola Normale Superiore, Pisa"},{"key":"20_CR17","unstructured":"M. Forti and F. Honsell. A general construction of hyperuniverses. Technical Report 1992\/9, Istituto di Matematiche Applicate U. Dini, Facolt\u00e0 di Ingegneria, Universit\u00e0 di Pisa, 1992."},{"key":"20_CR18","unstructured":"T. Hagino. A Categorical Programming Language. PhD thesis, University of Edinburgh, September 1987."},{"key":"20_CR19","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(88)90143-0","volume":"59","author":"W.H. Hesselink","year":"1988","unstructured":"W.H. Hesselink. Deadlock and fairness in morphisms of transition systems. Theoretical Computer Science, 59:235\u2013257, 1988.","journal-title":"Theoretical Computer Science"},{"key":"20_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics","author":"S. M. Lane","year":"1971","unstructured":"S. Mac Lane. Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics. Springer-Verlag, Berlin, 1971."},{"key":"20_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4872-9","volume-title":"Mathematics: Form and Function","author":"S. M. Lane","year":"1986","unstructured":"S. Mac Lane. Mathematics: Form and Function. Springer-Verlag, Berlin, 1986."},{"key":"20_CR22","volume-title":"Perspectives in Mathematical Logic","author":"A. Levy","year":"1979","unstructured":"A. Levy. Basic Set Theory. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1979."},{"key":"20_CR23","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01752392","volume":"14","author":"D. Lehmann","year":"1981","unstructured":"D. Lehmann and M.B. Smyth. Algebraic specifications of data types: a synthetic approach. Mathematical Systems Theory, 14:97\u2013139, 1981.","journal-title":"Mathematical Systems Theory"},{"key":"20_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science","author":"R. Milner","year":"1980","unstructured":"R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1980."},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"E. Moggi. Computational lambda-calculus and monads. In Proc. Fourth IEEE Symp. on Logic In Computer Science, pages 14\u201323. IEEE Computer Society Press, 1989.","DOI":"10.1109\/LICS.1989.39155"},{"key":"20_CR26","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(91)90033-X","volume":"87","author":"R. Milner","year":"1991","unstructured":"R. Milner and M. Tofte. Co-induction in relational semantics. Theoretical Computer Science, 87:209\u2013220, 1991.","journal-title":"Theoretical Computer Science"},{"key":"20_CR27","unstructured":"F.J. Oles. A category-theoretic approach to the semantics of programming languages. PhD thesis, School of Computer and Information Science, Syracuse University, August 1982."},{"key":"20_CR28","first-page":"167","volume-title":"Proceedings 5th GI Conference, volume 104 of Lecture Notes in Computer Science","author":"D.M.R. Park","year":"1981","unstructured":"D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Proceedings 5th GI Conference, volume 104 of Lecture Notes in Computer Science, pages 167\u2013183. Springer-Verlag, Berlin, 1981."},{"key":"20_CR29","unstructured":"A.M. Pitts. A co-induction principle for recursively defined domains. Technical Report 252, Computer Laboratory, University of Cambridge, 1992."},{"key":"20_CR30","unstructured":"G.D. Plotkin. Post-graduate lecture notes in advanced domain theory (incorporating the \u201cPisa Notes\u201d). Department of Computer Science, Univ. of Edinburgh, 1981."},{"key":"20_CR31","unstructured":"G.D. Plotkin. A structured approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981."},{"key":"20_CR32","unstructured":"J.J.M.M. Rutten. Deriving denotational models for bisimulation from Structured Operational Semantics. In M. Broy and C.B. Jones, editors, Programming concepts and methods, proceedings of the IFIP Working Group 2.2\/2.3 Working Conference, pages 155\u2013177. North-Holland, 1990."},{"key":"20_CR33","volume-title":"Technical Report CS-R9211","author":"J.J.M.M. Rutten","year":"1992","unstructured":"J.J.M.M. Rutten. Processes as terms: non-well-founded models for bisimulation. Technical Report CS-R9211, CWI (Centre for Mathematics and Computer Science), Amsterdam, 1992. To appear in Mathematical Structures in Computer Science."},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"M.B. Smyth. I-categories and duality. In M.P. Fourman, P.T. Johnstone, and A.M. Pitts, editors, Applications of categories in computer science, volume 177 of London Mathematical Society Lecture Note Series, pages 270\u2013287. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511525902.016"},{"key":"20_CR35","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"M.B. Smyth","year":"1982","unstructured":"M.B. Smyth and G.D. Plotkin. The category-theoretic solution of recursive domain equations. SIAM J. Comput., 11:761\u2013783, 1982.","journal-title":"SIAM J. Comput"}],"container-title":["Lecture Notes in Computer Science","Semantics: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56596-5_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:50:40Z","timestamp":1640926240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56596-5_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565963","9783540475958"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-56596-5_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}