Algebra and Coalgebra in Computer Science
DOI10.1007/11548133zbMATH Open1151.68536OpenAlexW249899439MaRDI QIDQ5492811FDOQ5492811
Authors: Bartek Klin, Vladimiro Sassone, 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
Recommendations
- scientific article
- Generalized theorems on relationships among reducibility notions to certain complexity classes
- Semantic labelling for proving termination of combinatory reduction systems
- scientific article; zbMATH DE number 1864591
- scientific article; zbMATH DE number 5927290
- scientific article; zbMATH DE number 2154080
- Generalized effective reducibility
- On Relating Theories: Proof-Theoretical Reduction
- Reducibility Proofs in the λ-Calculus
- Reductions on equivalence relations generated by universal sets
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
- Directed bigraphs
- 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?)
- A coalgebraic theory of reactive systems
- A well-behaved LTS for the pi-calculus (abstract)
- On symbolic semantics for name-decorated contexts
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)
