A rule format for unit elements
2010 (engelsk)Inngår i: SOFSEM 2010: Theory and Practice of Computer Science: Proceedings / [ed] VanLeeuwen, J, Muscholl, A, Peleg, D, Pokorny, J, Rumpe, B, Berlin: Springer Berlin/Heidelberg, 2010, Vol. 5901, s. 141-152Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]
This paper offers a meta-theorem for languages with a Structural Operational Semantics (SOS) in the style of Plotkin. Namely, it proposes a generic rule format for SOS guaranteeing that certain constants act as left- or right-unit elements for a set of binary operators. We show the generality of our format by applying it to a wide range of operators from the literature on process calculi.
sted, utgiver, år, opplag, sider
Berlin: Springer Berlin/Heidelberg, 2010. Vol. 5901, s. 141-152
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 5901
Emneord [en]
Binary operators, Generic rules, Meta-theorems, Process calculi, Rule formats, Structural operational semantics
HSV kategori
Identifikatorer
URN: urn:nbn:se:hh:diva-20512DOI: 10.1007/978-3-642-11266-9_12ISI: 000280086900012Scopus ID: 2-s2.0-77249145965ISBN: 978-3-642-11265-2 ISBN: 978-3-642-11266-9 OAI: oai:DiVA.org:hh-20512DiVA, id: diva2:584496
Konferanse
36th Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn, Czech Republic, January 23-29, 2010
2013-01-092013-01-082018-01-11bibliografisk kontrollert