Algebra and Coalgebra in Computer Science

DOI10.1007/11548133zbMATH Open1151.18001OpenAlexW249899439MaRDI QIDQ5492822FDOQ5492822

Authors: H. Peter Gumm 

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Recommendations

• Functors for coalgebras
• Foundations of Software Science and Computation Structures
• On coalgebras and type transformations
• On the structure of categories of coalgebras
• On tree coalgebras and coalgebra presentations

Mathematics Subject Classification ID

Temporal logic (03B44) Eilenberg-Moore and Kleisli constructions for monads (18C20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)

Cited In (14)

• Rigidity of unary algebras and its application to the \({\mathcal {HS} = \mathcal {SH}}\) problem
• The \({\mathcal {HS}} = {\mathcal {SH}}\) problem for coalgebras
• Hybrid logic with the difference modality for generalisations of graphs
• A coalgebraic take on regular and \(\omega\)-regular behaviour for systems with internal moves
• Title not available (Why is that?)
• A point-free perspective on lax extensions and predicate liftings
• A coalgebraic view on reachability
• Quotients of Bounded Natural Functors
• Title not available (Why is that?)
• On coalgebras and type transformations
• On minimal coalgebras
• Weak completeness of coalgebraic dynamic logics
• Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
• On products of transition systems

This page was built for publication: Algebra and Coalgebra in Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492822)