Skip to main content
Conference Proceedings

Rule formats for distributivity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6638 LNCS 80-91
DOI: 10.1007/978-3-642-21254-3_5
5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Aceto, L., Cimini, M., Ingolfsdottir, A., Mousavi, M. R., & Reniers, M. A. (2011). Rule formats for distributivity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6638 LNCS, pp. 80–91). Springer Verlag. https://doi.org/10.1007/978-3-642-21254-3_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free