CIA structures and the semantics of recursion

DOI10.1007/978-3-642-12032-9_22MaRDI QIDQ3557859zbMATH OpenOpenAlexFDO

Authors Stefan Milius, Lawrence S. Moss, Daniel Schwencke

Publication date 27 April 2010

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12032-9_22

zbMATH Keywords

coalgebracompletely iterative algebradistributive lawrecursionsemantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65)

Recommendations

• Abstract GSOS rules and a modular treatment of recursive definitions
• Recursive coalgebras from comonads
• Recursive coalgebras from comonads
• Universal coalgebra: A theory of systems
• An approach to object semantics based on terminal co-algebras

Cited in

(4)

• Recursive coalgebras from comonads
• scientific article; zbMATH DE number 5994844 (Why is no real title available?)
• Finite behaviours and finitary corecursion
• Bialgebras for structural operational semantics: an introduction

This page was built for publication: CIA structures and the semantics of recursion

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