| 1. |
- Aceto, Luca, et al.
(författare)
-
Rule Formats for Distributivity
- 2012
-
Ingår i: Theoretical Computer Science. - : Elsevier BV. - 0304-3975 .- 1879-2294. ; 458, s. 1-28
-
Tidskriftsartikel (refereegranskat)abstract
- This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats. Some conditions ensuring the invalidity of the left-distributivity law are also offered. © 2012 Elsevier B.V. All rights reserved.
|
|
| 2. |
- Aceto, Luca, et al.
(författare)
-
Rule Formats for Distributivity
- 2011
-
Ingår i: Language and Automata Theory and Applications. - Heidelberg : Springer Berlin/Heidelberg. - 9783642212536 ; , s. 79-90
-
Konferensbidrag (refereegranskat)abstract
- This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats. © 2011 Springer-Verlag.
|
|
| 3. |
- Aceto, Luca, et al.
(författare)
-
SOS Rule Formats for Zero and Unit Elements
- 2011
-
Ingår i: Theoretical Computer Science. - Amsterdam : Elsevier. - 0304-3975 .- 1879-2294. ; 412:28, s. 3045-3071
-
Tidskriftsartikel (refereegranskat)abstract
- This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain constants act as left or right unit/zero elements for a set of binary operators. Examples of left and right zero, as well as unit, elements from the literature are shown to fit the rule formats offered in this study. © 2011 Elsevier B.V. All rights reserved.
|
|
| 4. |
- Cimini, Matteo, et al.
(författare)
-
Nominal SOS
- 2012
-
Ingår i: Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVIII). - Amsterdam : Elsevier. ; , s. 103-116
-
Konferensbidrag (refereegranskat)abstract
- Plotkin’s style of Structural Operational Semantics (SOS) has become a de facto standard in giving operational semantics to formalisms and process calculi. In many such formalisms and calculi, the concepts of names, variables and binders are essential ingredients. In this paper, we propose a formal framework for dealing with names in SOS. The framework is based on the Nominal Logic of Gabbay and Pitts and hence is called Nominal SOS. We define nominal bisimilarity, an adaptation of the notion of bisimilarity that is aware of binding. We provide evidence of the expressiveness of the framework by formulating the early π-calculus and Abramsky’s lazy λ-calculus within Nominal SOS. For both calculi we establish the operational correspondence with the original calculi. Moreover, in the context of the π-calculus, we prove that nominal bisimilarity coincides with Sangiorgi’s open bisimilarity and in the context of the λ-calculus we prove that nominal bisimilarity coincides with Abramsky’s applicative bisimilarity. © 2012 Elsevier B.V.
|
|
