JUCS - Journal of Universal Computer Science 11(7): 1327-1348, doi: 10.3217/jucs-011-07-1327
An Equational Specification for the Scheme Language
expand article infoMarcelo d Amorim‡, Grigore Rosu‡
‡ Formal Systems Laboratory, Department of Computer Science, University of Illinois Urbana­Champaign, United States of America

Corresponding author: Marcelo Amorim ( damorim@cs.uiuc.edu )

© Marcelo Amorim, Grigore Rosu.
This article is freely available under the J.UCS Open Content License.
Citation: Amorim M, Rosu G (2005) An Equational Specification for the Scheme Language. JUCS - Journal of Universal Computer Science 11(7): 1327-1348. https://doi.org/10.3217/jucs-011-07-1327
Open Access
Abstract
This work describes the formal semantics of Scheme 3 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.
Keywords
formal and executable semantics, equational specification, program analysis