Modular rewriting semantics in practice

Christiano Braga, José Meseguer

Research output: Contribution to journalArticlepeer-review

Abstract

We present a general method to achieve modularity of semantic definitions of programming languages specified as rewrite theories, so that semantic rules do not have to be redefined in language extensions. We illustrate the practical use of this method by means of two language case studies: two different semantics for CCS, and three different semantics for the GNU bc language.

Original languageEnglish (US)
Pages (from-to)393-416
Number of pages24
JournalElectronic Notes in Theoretical Computer Science
Volume117
Issue numberSPEC. ISS.
DOIs
StatePublished - Jan 20 2005

Keywords

  • Modularity
  • Programming languages semantics
  • Rewriting logic

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Modular rewriting semantics in practice'. Together they form a unique fingerprint.

Cite this