On the final sequence of a finitary set functor
From MaRDI portal
Publication:557796
DOI10.1016/j.tcs.2004.12.009zbMath1070.18004OpenAlexW2042266169MaRDI QIDQ557796
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.009
Abstract data types; algebraic specification (68Q65) Applications of set theory (03E75) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Categories of sets, characterizations (18B05)
Related Items
Coinductive predicates and final sequences in a fibration, Relating Coalgebraic Notions of Bisimulation, Fixed points of set functors: how many iterations are needed?, Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets, Unnamed Item, On Coalgebras over Algebras, The category-theoretic solution of recursive program schemes, Semantics of higher-order quantum computation via geometry of interaction, Equational properties of iterative monads, Coequational logic for accessible functors, Unnamed Item, Unnamed Item, On coalgebras over algebras, Coalgebraic semantics of modal logics: an overview, Relatively terminal coalgebras, A description based on languages of the final non-deterministic automaton, Constructive logical characterizations of bisimilarity for reactive probabilistic systems, Pointwise extensions of GSOS-defined operations, Initial algebras and terminal coalgebras in many-sorted sets, Modular construction of complete coalgebraic logics, Stochastic coalgebraic logic: bisimilarity and behavioral equivalence, Expressivity of coalgebraic modal logic: the limits and beyond, Realization of Coinductive Types, Fixed Points of Functors - A Short Abstract, A compositional approach to defining logics for coalgebras, Completely iterative algebras and completely iterative monads, Terminal coalgebras and free iterative theories, On final coalgebras of power-set functors and saturated trees, Terminal Sequence Induction via Games, Final coalgebras in accessible categories, Coinductive predicates and final sequences in a fibration, Efficient Coalgebraic Partition Refinement, A logic of implications in algebra and coalgebra, Simplified Coalgebraic Trace Equivalence, Structural operational semantics for continuous state stochastic transition systems, Corecursion up-to via causal transformations, Coequational Logic for Finitary Functors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semi-metrics, closure spaces and digital topology
- On the greatest fixed point of a set functor
- Solving reflexive domain equations in a category of complete metric spaces
- Non-well-founded sets modeled as ideal fixed points
- Least fixed point of a functor
- Algebraically compact functors
- Coalgebraic logic
- On final coalgebras of continuous functors
- A small final coalgebra theorem
- Universal coalgebra: A theory of systems
- Category theory and computer science. Manchester, UK, September 5--8, 1989. Proceedings
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Terminal coalgebras in well-founded set theory
- On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
- Final coalgebras as greatest fixed points in ZF set theory
- From Varieties of Algebras to Covarieties of Coalgebras
- Functors for coalgebras
