A final coalgebra theorem
From MaRDI portal
Recommendations
Cites work
Cited in
(89)- Bialgebraic methods and modal logic in structural operational semantics
- A fixpoint approach to finite delay and fairness
- Structural induction and coinduction in a fibrational setting
- Coalgebraic logic
- Defining concurrent processes constructively
- Additions and corrections to ``Terminal coalgebras in well-founded set theory
- Open maps, behavioural equivalences, and congruences
- Semantics for finite delay
- Observational ultraproducts of polynomial coalgebras.
- On coalgebra based on classes
- Towards a unified view of bisimulation: A comparative study
- A small final coalgebra theorem
- Universal coalgebra: A theory of systems
- A complete logic for behavioural equivalence in coalgebras of finitary set functors
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- Extensional quotient coalgebras
- The converse of a stochastic relation
- On tree coalgebras and coalgebra presentations
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- On \(\mathbf{MV} \)-coalgebras over the category of BL-algebras
- Corecursion up-to via causal transformations
- Isomorphism theorems for coalgebras
- Bisimulation and coinduction enhancements: a historical perspective
- From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference
- Relational presheaves, change of base and weak simulation
- Terminal coalgebras in well-founded set theory
- Modular construction of complete coalgebraic logics
- Final coalgebras for functors on measurable spaces
- Terminal coalgebras and free iterative theories
- Bisimulation for labelled Markov processes
- On final coalgebras of power-set functors and saturated trees
- Final coalgebras and the Hennessy-Milner property
- Coalgebras for fuzzy transition systems
- Rule formats for timed processes
- Final coalgebras and a solution theorem for arbitrary endofunctors
- GSOS for probabilistic transition systems (extended abstract)
- Modal predicates and coequations
- Towards coalgebraic behaviourism
- On rational monads and free iterative theories
- Properties of set functors
- Transition systems from event structures revisited
- Relation lifting, a survey
- Behavioural equivalences for timed systems
- Bisimulations generated from corecursive equations
- How to reason coinductively informally
- Proof systems for Moss' coalgebraic logic
- Modalities in the Stone age: a comparison of coalgebraic logics
- Final Coalgebras are Ideal Completions of Initial Algebras
- Bisimulation for probabilistic transition systems: a coalgebraic approach
- A modal characterization of alternating approximate bisimilarity
- Modal rules are co-implications
- Modal languages for coalgebras in a topological setting
- Minimality Notions via Factorization Systems and Examples
- Convenient category of processes and simulations I: Modulo strong bisimilarity
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
- Structural operational semantics for non-deterministic processes with quantitative aspects
- Rough and Near: Modal History of Two Theories
- Mongruences and cofree coalgebras
- Representing continuous functions between greatest fixed points of indexed containers
- Efficient and modular coalgebraic partition refinement
- On finitary functors
- Enhanced coalgebraic bisimulation
- Services and Contracts: Coalgebraically
- A general final coalgebra theorem
- Realization of coinductive types
- scientific article; zbMATH DE number 7649955 (Why is no real title available?)
- Final universes of processes
- A structural co-induction theorem
- On the structure of categories of coalgebras
- From modal logic to terminal coalgebras
- A concrete final coalgebra theorem for ZF set theory
- Preservation and reflection of bisimilarity via invertible steps
- Coalgebras in functional programming and type theory
- The eventual image
- Coalgebraic satisfiability checking for arithmetic -calculi
- Monoidal streams for dataflow programming
- Graded monads and behavioural equivalence games
- Exact sequences in categories of coalgebras
- Proving behavioural apartness
- Unifying equivalences for timed transition systems
- Coinductive streams in monoidal categories
- A classification of bisimilarities for general Markov decision processes
- A hierarchy of probabilistic system types
- Identity-preserving Lax extensions and where to find them
- Quantitative simulations by matrices
- Terminal coalgebras and non-wellfounded sets in homotopy type theory
- On some properties of topological \(\mathbb{MV}\)-coalgebras.
- The graph conception of set
- Behavioural equivalences for coalgebras with unobservable moves
This page was built for publication: A final coalgebra theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096269)
