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 language | English (US) |
---|---|
Pages (from-to) | 393-416 |
Number of pages | 24 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 117 |
Issue number | SPEC. ISS. |
DOIs | |
State | Published - Jan 20 2005 |
Keywords
- Modularity
- Programming languages semantics
- Rewriting logic
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science