On Well-Foundedness and Expressiveness of Promoted Tyft

DOI10.1016/j.entcs.2006.09.015zbMath1277.68125OpenAlexW2150711875WikidataQ57745712 ScholiaQ57745712MaRDI QIDQ2866315

No author found.

Publication date: 13 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.09.015

zbMATH Keywords

structural operational semantics (SOS)promoted tyftSOS rule formats

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (1)

SOS formats and meta-theory: 20 years after

Cites Work

• Unnamed Item
• Unnamed Item
• Structured operational semantics and bisimulation as a congruence
• A theory of higher order communicating systems
• Proving congruence of bisimulation in functional programming languages
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• CONCUR 2005 – Concurrency Theory

This page was built for publication: On Well-Foundedness and Expressiveness of Promoted Tyft