A final coalgebra theorem

From MaRDI portal
Publication:5096269

DOI10.1007/BFb0018361zbMath1496.03206OpenAlexW1543688617WikidataQ56579621 ScholiaQ56579621MaRDI QIDQ5096269

Peter Aczel, Nax Paul Mendler

Publication date: 16 August 2022

Published in: Category Theory and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0018361



Related Items

Coalgebras for fuzzy transition systems, Final universes of processes, A structural co-induction theorem, Terminal coalgebras in well-founded set theory, Minimality Notions via Factorization Systems and Examples, On tree coalgebras and coalgebra presentations, Transition systems from event structures revisited, Relation lifting, a survey, Bisimulations Generated from Corecursive Equations, Convenient category of processes and simulations I: Modulo strong bisimilarity, Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence, Unnamed Item, On Finitary Functors, Rough and Near: Modal History of Two Theories, A fixpoint approach to finite delay and fairness, Mongruences and cofree coalgebras, Open maps, behavioural equivalences, and congruences, A complete logic for behavioural equivalence in coalgebras of finitary set functors, Semantics for finite delay, Behavioural equivalences for coalgebras with unobservable moves, Proof systems for Moss' coalgebraic logic, A concrete final coalgebra theorem for ZF set theory, Preservation and reflection of bisimilarity via invertible steps, Modalities in the Stone age: a comparison of coalgebraic logics, Unnamed Item, Enhanced coalgebraic bisimulation, Observational ultraproducts of polynomial coalgebras., Coalgebras in functional programming and type theory, Bisimulation for probabilistic transition systems: A coalgebraic approach, On coalgebra based on classes, A modal characterization of alternating approximate bisimilarity, Constructive logical characterizations of bisimilarity for reactive probabilistic systems, How to Reason Coinductively Informally, Modular construction of complete coalgebraic logics, Structural operational semantics for non-deterministic processes with quantitative aspects, Extensional quotient coalgebras, Unnamed Item, Modal Rules are Co-Implications, Modal Languages for Coalgebras in a Topological Setting, Services and Contracts: Coalgebraically, Realization of Coinductive Types, The converse of a stochastic relation, A hierarchy of probabilistic system types, On the structure of categories of coalgebras, From modal logic to terminal coalgebras, Isomorphism theorems for coalgebras, Terminal coalgebras and free iterative theories, Bisimulation and coinduction enhancements: a historical perspective, Bisimulation for labelled Markov processes, Quantitative simulations by matrices, On final coalgebras of power-set functors and saturated trees, The graph conception of set, Bialgebraic methods and modal logic in structural operational semantics, Structural induction and coinduction in a fibrational setting, Rule Formats for Timed Processes, Towards a unified view of bisimulation: A comparative study, A small final coalgebra theorem, Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors, GSOS for probabilistic transition systems, Modal Predicates and Coequations, Towards coalgebraic behaviourism, On Rational Monads and Free Iterative Theories, Coalgebraic logic, Universal coalgebra: A theory of systems, Bisimulation for probabilistic transition systems: A coalgebraic approach, Unnamed Item, Final coalgebras and the Hennessy-Milner property, From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference, Relational presheaves, change of base and weak simulation, On \(\mathbf{MV} \)-coalgebras over the category of BL-algebras, Corecursion up-to via causal transformations, Defining concurrent processes constructively, Additions and corrections to ``Terminal coalgebras in well-founded set theory



Cites Work