SOS rule formats for idempotent terms and idempotent unary operators

Aceto, Luca; Ingólfsdóttir, Anna; Goriac, Eugen-Ioan

doi:10.1016/j.jlap.2013.07.003

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Book1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 36 publications

(77 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Apart from offering the proofs of results that were announced without proof in that reference and a variety of examples of applications of our rule formats, this version of the paper also presents a generalization of the rule format for idempotent unary operations given in [9].…”

Section: Introductionmentioning

confidence: 99%

SOS Rule Formats for Idempotent Terms and Idempotent Unary Operators

Aceto

Goriac

Ingólfsdóttir

2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

A unary operator f is idempotent if the equation f (x) = f (f (x)) holds. On the other end, an element a of an algebra is said to be an idempotent for a binary operator if a = a a. This paper presents a rule format for Structural Operational Semantics that guarantees that a unary operator be idempotent modulo bisimilarity. The proposed rule format relies on a companion one ensuring that certain terms are idempotent with respect to some binary operator. This study also offers a variety of examples showing the applicability of both formats.

show abstract

Section: Introductionmentioning

confidence: 99%