On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces

From MaRDI portal
Publication:4236207

DOI10.1017/S0960129598002588zbMath0917.68140OpenAlexW2104603764MaRDI QIDQ4236207

Daniele Turi, Jan J. M. M. Rutten

Publication date: 8 August 1999

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129598002588




Related Items (29)

Distributivity of categories of coalgebrasRecursively defined metric spaces without contractionNon-well-founded trees in categoriesThe category-theoretic solution of recursive metric-space equationsSemantics for finite delayNatural duality, modality, and coalgebraCoalgebras in functional programming and type theoryDomain Equations Based on Sets with Families of Pre-ordersA Single Complete Relational Rule for Coalgebraic RefinementOn coalgebra based on classesElements of generalized ultrametric domain theory(Metric) Bisimulation Games and Real-Valued Modal Logics for CoalgebrasMany-Sorted Coalgebraic Modal Logic: a Model-theoretic StudyProcess Calculi à la Bird-MeertensModal Languages for Coalgebras in a Topological SettingQuantitative Kleene coalgebrasStone coalgebrasOn the computational complexity of bisimulation, reduxA behavioural pseudometric for probabilistic transition systemsA coalgebraic presentation of structured transition systemsParametric corecursionOn the final sequence of a finitary set functorHausdorff coalgebrasApproximating and computing behavioural distances in probabilistic transition systemsThe graph conception of setThe semantics of the combination of atomized statements and parallel choiceExtending set functors to generalised metric spacesFinal Coalgebras And a Solution Theorem for Arbitrary EndofunctorsTowards coalgebraic behaviourism






This page was built for publication: On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces