AbstractA rewrite logic semantic definitional framework for programming languages is introduced, called K, together with partially automated translations of K language definitions into rewriting logic and into C. The framework is exemplified by defining SILF, a simple imperative language with functions. The translation of K definitions into rewriting logic enables the use of the various analysis tools developed for rewrite logic specifications, while the translation into C allows for very efficient interpreters. A suite of tests show the performance of interpreters compiled from K definitions
The task of designing and implementing a compiler can be a difficult and error-prone process. In thi...
AbstractProgramming language semantics based on pure rewrite rules suffers from the gap between the ...
In this paper, we present an overview of our method of specifying the semantics of programming langu...
A rewrite logic semantic definitional framework for programming languages is introduced, called K, t...
AbstractA rewrite logic semantic definitional framework for programming languages is introduced, cal...
This paper describes a completely automated method for generating efficient and competitive interpre...
K is an algebraic framework for defining programming languages. It consists of a technique and of a ...
K is an algebraic framework for defining programming languages. It consists of a technique and of a ...
AbstractK is an executable semantic framework in which programming languages, calculi, as well as ty...
AbstractRewriting logic is a flexible and expressive logical framework that unifies denotational sem...
This paper introduces a framework for rapid prototyping of object oriented programming languages and...
Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics a...
We show how one can use rewriting logic to faithfully capture (not implement) various operational se...
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational s...
AbstractWe present a general method to achieve modularity of semantic definitions of programming lan...
The task of designing and implementing a compiler can be a difficult and error-prone process. In thi...
AbstractProgramming language semantics based on pure rewrite rules suffers from the gap between the ...
In this paper, we present an overview of our method of specifying the semantics of programming langu...
A rewrite logic semantic definitional framework for programming languages is introduced, called K, t...
AbstractA rewrite logic semantic definitional framework for programming languages is introduced, cal...
This paper describes a completely automated method for generating efficient and competitive interpre...
K is an algebraic framework for defining programming languages. It consists of a technique and of a ...
K is an algebraic framework for defining programming languages. It consists of a technique and of a ...
AbstractK is an executable semantic framework in which programming languages, calculi, as well as ty...
AbstractRewriting logic is a flexible and expressive logical framework that unifies denotational sem...
This paper introduces a framework for rapid prototyping of object oriented programming languages and...
Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics a...
We show how one can use rewriting logic to faithfully capture (not implement) various operational se...
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational s...
AbstractWe present a general method to achieve modularity of semantic definitions of programming lan...
The task of designing and implementing a compiler can be a difficult and error-prone process. In thi...
AbstractProgramming language semantics based on pure rewrite rules suffers from the gap between the ...
In this paper, we present an overview of our method of specifying the semantics of programming langu...