A Rule Format for Unit Elements

Authors:
Luca Aceto;Anna Ingolfsdottir;Mohammadreza Mousavi;Michel A. Reniers
Affiliations:
ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland IS-103;ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland IS-103;Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands NL-5600;Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands NL-5600
Venue:
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 9
Cited 4

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Communicating sequential processes

Communicating sequential processes
Communication and Concurrency

Communication and Concurrency
A congruence theorem for structured operational semantics with predicates and negative premises

Nordic Journal of Computing
A Powerdomain for Countable Non-Determinism (Extended Abstract)

Proceedings of the 9th Colloquium on Automata, Languages and Programming
SOS formats and meta-theory: 20 years after

Theoretical Computer Science
A Rule Format for Associativity

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A syntactic commutativity format for SOS

Information Processing Letters
Rule formats for determinism and idempotence

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering

On Rule Formats for Zero and Unit Elements

Electronic Notes in Theoretical Computer Science (ENTCS)
Rule formats for distributivity

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Rule formats for determinism and idempotence

Science of Computer Programming
Rule formats for distributivity

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.