AbstractWe 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
K is an algebraic framework for defining programming languages. It consists of a technique and of a ...
Our aim is to bring modularity to system specification in rewriting logic. Modularity here is in the...
AbstractThese notes give an overview of the main frameworks that have been developed for specifying ...
A complete formal semantic description of a practical programming language (such as Java) is likely ...
We show how one can use rewriting logic to faithfully capture (not implement) various operational se...
AbstractRewriting logic is a flexible and expressive logical framework that unifies denotational sem...
Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics a...
AbstractRewriting logic is a flexible and expressive logical framework that unifies algebraic denota...
AbstractThis paper shows how rewriting logic semantics (RLS) can be used as a computational logic fr...
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational s...
AbstractA complete formal semantic description of a practical programming language (such as Java) is...
This work describes the formal semantics of Scheme (Based on the publicly available report R5RS) as ...
AbstractThis paper shows how rewriting logic semantics (RLS) can be used as a computational logic fr...
K is an algebraic framework for defining programming languages. It consists of a technique and of a ...
Semantic specifications of programming languages typically have poor modularity. This hinders reuse ...
K is an algebraic framework for defining programming languages. It consists of a technique and of a ...
Our aim is to bring modularity to system specification in rewriting logic. Modularity here is in the...
AbstractThese notes give an overview of the main frameworks that have been developed for specifying ...
A complete formal semantic description of a practical programming language (such as Java) is likely ...
We show how one can use rewriting logic to faithfully capture (not implement) various operational se...
AbstractRewriting logic is a flexible and expressive logical framework that unifies denotational sem...
Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics a...
AbstractRewriting logic is a flexible and expressive logical framework that unifies algebraic denota...
AbstractThis paper shows how rewriting logic semantics (RLS) can be used as a computational logic fr...
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational s...
AbstractA complete formal semantic description of a practical programming language (such as Java) is...
This work describes the formal semantics of Scheme (Based on the publicly available report R5RS) as ...
AbstractThis paper shows how rewriting logic semantics (RLS) can be used as a computational logic fr...
K is an algebraic framework for defining programming languages. It consists of a technique and of a ...
Semantic specifications of programming languages typically have poor modularity. This hinders reuse ...
K is an algebraic framework for defining programming languages. It consists of a technique and of a ...
Our aim is to bring modularity to system specification in rewriting logic. Modularity here is in the...
AbstractThese notes give an overview of the main frameworks that have been developed for specifying ...
DOI
Add to ORKG