| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9656031 | Electronic Notes in Theoretical Computer Science | 2005 | 24 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Christiano Braga, José Meseguer,