Adding recursive constructs to bialgebraic semantics

DOI10.1016/j.jlap.2004.03.005zbMath1072.68059OpenAlexW2094700434MaRDI QIDQ1878714

Bartek Klin

Publication date: 8 September 2004

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2004.03.005

zbMATH Keywords

structural operational semanticsrecursive equations

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (8)

Relating Coalgebraic Notions of Bisimulation ⋮ Structural congruence for bialgebraic semantics ⋮ The Expression Lemma ⋮ Modularity and Implementation of Mathematical Operational Semantics ⋮ Bialgebraic methods and modal logic in structural operational semantics ⋮ Bi-inductive structural semantics ⋮ Bialgebraic Methods in Structural Operational Semantics ⋮ Bi-inductive Structural Semantics

Cites Work

• A domain equation for bisimulation
• Towards Weak Bisimulation For Coalgebras
• Well-behaved Translations between Structural Operational Semantics
• Initial Algebra Semantics and Continuous Algebras
• Bisimulation can't be traced
• A Coalgebraic View of Infinite Trees and Iteration
• A note on Coinduction and Weak Bisimilarity for While Programs
• CONCUR 2003 - Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Adding recursive constructs to bialgebraic semantics