Modular Rewriting Semantics in Practice
Christiano de Oliveira Braga, José Meseguer · Electronic Notes in Theoretical Computer Science · 2005
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.