From rewrite rules to bisimulation congruences

@article{Sewell2002FromRR,
  title={From rewrite rules to bisimulation congruences},
  author={Peter Sewell},
  journal={Theor. Comput. Sci.},
  year={2002},
  volume={274},
  pages={183-230}
}
The dynamics of many calculi can be most clearly defined by a reduction semantics. To work with a calculus, however, an understanding of operational congruences is fundamental; these can often be given tractable definitions or characterisations using a labelled transition semantics. This paper considers calculi with arbitrary reduction semantics of three simple classes, firstly ground term rewriting, then left-linear term rewriting, and then a class which is essentially the action calculi… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 130 citations. REVIEW CITATIONS

4 Figures & Tables

Topics

Statistics

01020'01'03'05'07'09'11'13'15'17
Citations per Year

131 Citations

Semantic Scholar estimates that this publication has 131 citations based on the available data.

See our FAQ for additional information.