On the final sequence of a finitary set functor
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 1314223 (Why is no real title available?)
- scientific article; zbMATH DE number 575948 (Why is no real title available?)
- scientific article; zbMATH DE number 3291978 (Why is no real title available?)
- A small final coalgebra theorem
- Algebraically compact functors
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Category theory and computer science. Manchester, UK, September 5--8, 1989. Proceedings
- Coalgebraic logic
- Final coalgebras as greatest fixed points in ZF set theory
- From varieties of algebras to covarieties of coalgebras
- Functors for coalgebras
- Least fixed point of a functor
- Non-well-founded sets modeled as ideal fixed points
- On final coalgebras of continuous functors
- On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
- On the greatest fixed point of a set functor
- Semi-metrics, closure spaces and digital topology
- Solving reflexive domain equations in a category of complete metric spaces
- Terminal coalgebras in well-founded set theory
- Universal coalgebra: A theory of systems
Cited in
(55)- Greatest HITs: higher inductive types in coinductive definitions via induction under clocks
- Graded monads and behavioural equivalence games
- Proving behavioural apartness
- Simplified coalgebraic trace equivalence
- A ghost at \(\omega_1\)
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- Coequational logic for finitary functors
- Fixed Points of Functors - A Short Abstract
- A description based on languages of the final non-deterministic automaton
- Final coalgebras in accessible categories
- Logical construction of final coalgebras
- Semantics of higher-order quantum computation via geometry of interaction
- A general final coalgebra theorem
- Terminal Sequence Induction via Games
- Realization of coinductive types
- Coinductive predicates and final sequences in a fibration
- A final coalgebra theorem
- Coequational logic for accessible functors
- Complete sets of cooperations
- Equational properties of iterative monads
- The category-theoretic solution of recursive program schemes
- Terminal coalgebras and free iterative theories
- Structural operational semantics for continuous state stochastic transition systems
- Coalgebraic semantics of modal logics: an overview
- scientific article; zbMATH DE number 7379294 (Why is no real title available?)
- Efficient Coalgebraic Partition Refinement
- Finitary Functors: From Set to Preord and Poset
- Initial algebras and terminal coalgebras in many-sorted sets
- A compositional approach to defining logics for coalgebras
- Some properties and some problems on set functors
- Pointwise extensions of GSOS-defined operations
- On final coalgebras of power-set functors and saturated trees
- On final coalgebras of continuous functors
- Power-set functors and saturated trees
- Algebra and Coalgebra in Computer Science
- Type-Theoretic Constructions of the Final Coalgebra of the Finite Powerset Functor.
- Stochastic coalgebraic logic: bisimilarity and behavioral equivalence
- The Sierpinski carpet as a final coalgebra
- scientific article; zbMATH DE number 7649944 (Why is no real title available?)
- A logic of implications in algebra and coalgebra
- Corecursion up-to via causal transformations
- Properties of set functors
- Completely iterative algebras and completely iterative monads
- Modular construction of complete coalgebraic logics
- Fixed points of set functors: how many iterations are needed?
- The eventual image
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
- Relatively terminal coalgebras
- Coinductive predicates and final sequences in a fibration
- On coalgebras over algebras
- Expressivity of coalgebraic modal logic: the limits and beyond
- Relating coalgebraic notions of bisimulation. With applications to name-passing process calculi (extended abstract)
- On coalgebras over algebras
- Efficient and modular coalgebraic partition refinement
- Finality regained: A coalgebraic study of Scott-sets and multisets
This page was built for publication: On the final sequence of a finitary set functor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557796)
