Add to ORKGAbstract: This work describes the formal semantics of Scheme 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
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...
In this paper we give a big-step structured operational semantics (SOS), in the style of Plotkin, Ka...
Abstract. This work describes the formal semantics of Scheme 1 as an equational theory in the Maude ...
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...
AbstractMaude is a high-level language and a high-performance system supporting executable specifica...
Maude is a high-level language and a high-performance system supporting executable specification and...
One can distinguish two specification levels: a system specification level, in which the computation...
In 1975 I started a small project to explore the consequences of implementing equational programs wi...
This paper presents an executable rewriting logic semantics of K-Scheme, a dialect of Scheme based (...
AbstractRewriting logic (RL) is a logic of actions whose models are concurrent systems. Rewrite theo...
Abstract: This paper is part of a long-term effort to increase expressiveness of algebraic specifica...
Since its introduction, more than one decade ago, rewriting logic has attracted the interest of both...
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...
In this paper we give a big-step structured operational semantics (SOS), in the style of Plotkin, Ka...
Abstract. This work describes the formal semantics of Scheme 1 as an equational theory in the Maude ...
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...
AbstractMaude is a high-level language and a high-performance system supporting executable specifica...
Maude is a high-level language and a high-performance system supporting executable specification and...
One can distinguish two specification levels: a system specification level, in which the computation...
In 1975 I started a small project to explore the consequences of implementing equational programs wi...
This paper presents an executable rewriting logic semantics of K-Scheme, a dialect of Scheme based (...
AbstractRewriting logic (RL) is a logic of actions whose models are concurrent systems. Rewrite theo...
Abstract: This paper is part of a long-term effort to increase expressiveness of algebraic specifica...
Since its introduction, more than one decade ago, rewriting logic has attracted the interest of both...
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...
In this paper we give a big-step structured operational semantics (SOS), in the style of Plotkin, Ka...