How to Kill Epsilons with a Dagger

DOI10.1007/978-3-662-44124-4_4MaRDI QIDQ2942775zbMATH OpenOpenAlexFDO

Authors Filippo Bonchi, Stefan Milius, Alexandra Silva, Fabio Zanasi

Publication date 11 September 2015

Published in Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44124-4_4

Mathematics Subject Classification ID

Categorical semantics of formal languages (18C50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
• A coalgebraic view of -transitions
• Coalgebraic Reasoning in Coq: Bisimulation and the λ-Coiteration Scheme
• Algebras and coalgebras in the light affine lambda calculus
• scientific article; zbMATH DE number 2087424
• Formalizing cut elimination of coalgebraic logics in Coq
• A coalgebraic presentation of structured transition systems
• scientific article; zbMATH DE number 1314221
• scientific article; zbMATH DE number 1314231
• scientific article; zbMATH DE number 1189282

Cited in

(1)

• Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure

This page was built for publication: How to Kill Epsilons with a Dagger

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