Algebra and Coalgebra in Computer Science
DOI10.1007/11548133zbMATH Open1151.68536OpenAlexW249899439MaRDI QIDQ5492811FDOQ5492811
Vladimiro Sassone, Bartek Klin, Paweล Sobociลski
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
Grammars and rewriting systems (68Q42) Theories (e.g., algebraic theories), structure, and semantics (18C10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (10)
- A General Theory of Barbs, Contexts, and Labels
- RPO, Second-Order Contexts, and ฮป-Calculus
- A semantic framework for open processes
- Title not available (Why is that?)
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
- Title not available (Why is that?)
- On Symbolic Semantics for Name-decorated Contexts
- A coalgebraic theory of reactive systems
- Directed Bigraphs
- A well-behaved LTS for the pi-calculus (abstract)
Recommendations
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Generalized theorems on relationships among reducibility notions to certain complexity classes ๐ ๐
- On Relating Theories: Proof-Theoretical Reduction ๐ ๐
- Reducibility Proofs in the ฮป-Calculus ๐ ๐
- Generalized Effective Reducibility ๐ ๐
- Semantic Labelling for Proving Termination of Combinatory Reduction Systems ๐ ๐
- Reductions on equivalence relations generated by universal sets ๐ ๐
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 Q5492811)
