On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
From MaRDI portal
Publication:4236207
DOI10.1017/S0960129598002588zbMATH Open0917.68140OpenAlexW2104603764MaRDI QIDQ4236207FDOQ4236207
Authors: 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
Recommendations
- Models of non-well-founded sets via an indexed final coalgebra theorem
- Terminal coalgebras in well-founded set theory
- Well-founded coalgebras, revisited
- A note on expressive coalgebraic logics for finitary set functors
- Finality regained: A coalgebraic study of Scott-sets and multisets
- Additions and corrections to ``Terminal coalgebras in well-founded set theory
- On well-founded and recursive coalgebras
- Logical construction of final coalgebras
- scientific article; zbMATH DE number 5041185
- A complete logic for behavioural equivalence in coalgebras of finitary set functors
Cited In (35)
- A structural co-induction theorem
- The semantics of the combination of atomized statements and parallel choice
- Process Calculi à la Bird-Meertens
- Quantitative Kleene coalgebras
- Final coalgebras and a solution theorem for arbitrary endofunctors
- On the final sequence of a finitary set functor
- Recursively defined metric spaces without contraction
- Natural duality, modality, and coalgebra
- Additions and corrections to ``Terminal coalgebras in well-founded set theory
- On the computational complexity of bisimulation, redux
- Modal languages for coalgebras in a topological setting
- Elements of generalized ultrametric domain theory
- Distributivity of categories of coalgebras
- Stone coalgebras
- (Metric) bisimulation games and real-valued modal logics for coalgebras
- Parametric corecursion
- Models of non-well-founded sets via an indexed final coalgebra theorem
- Semantics for finite delay
- The category-theoretic solution of recursive metric-space equations
- Domain equations based on sets with families of pre-orders.
- The graph conception of set
- Computable functions on final coalgebras
- Non-well-founded trees in categories
- On coalgebra based on classes
- Approximating and computing behavioural distances in probabilistic transition systems
- Sum and tensor of quantitative effects
- Coalgebras in functional programming and type theory
- Monoidal streams for dataflow programming
- A coalgebraic presentation of structured transition systems
- Towards coalgebraic behaviourism
- Many-sorted coalgebraic modal logic: A model-theoretic study
- A single complete relational rule for coalgebraic refinement
- Extending set functors to generalised metric spaces
- Hausdorff coalgebras
- A behavioural pseudometric for probabilistic transition systems
This page was built for publication: On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4236207)
