Add to ORKGAbstract. This work describes the formal semantics of Scheme 1 as an equational theory in the Maude rewriting system. The semantics is based on continuations and is highly modular. We briefly investigate the relationship between our methodology for defining programming languages and other semantic formalisms. We conclude by showing some performance results of the interpreter obtained for free from the executable specification.
Since its introduction, more than one decade ago, rewriting logic has attracted the interest of both...
This paper presents an executable rewriting logic semantics of K-Scheme, a dialect of Scheme based (...
AbstractRewriting logic is a flexible and expressive logical framework that unifies denotational sem...
Abstract: This work describes the formal semantics of Scheme as an equational theory in the Maude r...
This paper presents a formal definition of Scheme (based on the informal definition given in the R5R...
This paper presents an executable rewriting logic semantics of R5RS Scheme using the K definitional ...
Abstract. This paper presents an executable rewriting logic semantics of R5RS Scheme using the K def...
One can distinguish two specification levels: a system specification level, in which the computation...
AbstractMaude is a high-level language and a high-performance system supporting executable specifica...
In 1975 I started a small project to explore the consequences of implementing equational programs wi...
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational s...
Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics a...
Abstract: This paper is part of a long-term effort to increase expressiveness of algebraic specifica...
Maude is a high-level language and a high-performance system supporting executable specification and...
AbstractRewriting logic (RL) is a logic of actions whose models are concurrent systems. Rewrite theo...
Since its introduction, more than one decade ago, rewriting logic has attracted the interest of both...
This paper presents an executable rewriting logic semantics of K-Scheme, a dialect of Scheme based (...
AbstractRewriting logic is a flexible and expressive logical framework that unifies denotational sem...
Abstract: This work describes the formal semantics of Scheme as an equational theory in the Maude r...
This paper presents a formal definition of Scheme (based on the informal definition given in the R5R...
This paper presents an executable rewriting logic semantics of R5RS Scheme using the K definitional ...
Abstract. This paper presents an executable rewriting logic semantics of R5RS Scheme using the K def...
One can distinguish two specification levels: a system specification level, in which the computation...
AbstractMaude is a high-level language and a high-performance system supporting executable specifica...
In 1975 I started a small project to explore the consequences of implementing equational programs wi...
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational s...
Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics a...
Abstract: This paper is part of a long-term effort to increase expressiveness of algebraic specifica...
Maude is a high-level language and a high-performance system supporting executable specification and...
AbstractRewriting logic (RL) is a logic of actions whose models are concurrent systems. Rewrite theo...
Since its introduction, more than one decade ago, rewriting logic has attracted the interest of both...
This paper presents an executable rewriting logic semantics of K-Scheme, a dialect of Scheme based (...
AbstractRewriting logic is a flexible and expressive logical framework that unifies denotational sem...