Coalgebraic Components in a Many-Sorted Microcosm

DOI10.1007/978-3-642-03741-2_6zbMath1239.68044OpenAlexW2100285855MaRDI QIDQ2888477

Ichiro Hasuo, Bart Jacobs, Chris Heunen, Ana Sokolova

Publication date: 1 June 2012

Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2066/75330

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Related Items

``Keep definition, change category -- a practical approach to state-based system calculi ⋮ Categorifying Computations into Components via Arrows as Profunctors ⋮ Involutive categories and monoids, with a GNS-correspondence ⋮ A calculus for generic, QoS-aware component composition ⋮ Traces for coalgebraic components ⋮ A formal abstract framework for modelling and testing complex software systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions of computation and monads
• Two-dimensional monad theory
• Higher-dimensional algebra. III: \(n\)-categories and the algebra of opetopes
• Categorical logic and type theory
• Semantics of weakening and contraction
• Modelling environments in call-by-value programming languages.
• Generalising monads to arrows
• The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
• Comonadic Notions of Computation
• Categorical semantics for arrows
• Premonoidal categories and notions of computation
• Coalgebraic Logic and Synthesis of Mealy Machines
• The Microcosm Principle and Concurrency in Coalgebra
• Pseudo limits, biadjoints, and pseudo algebras: categorical foundations of conformal field theory