An operational semantics for Scheme

Authors:
John D. Ramsdell
Affiliations:
The MITRE Corporation
Venue:
ACM SIGPLAN Lisp Pointers
Year:
1992

Citing 6
Cited 2

Denotational semantics: a methodology for language development

Denotational semantics: a methodology for language development
Typing first-class continuations in ML

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Std 1178-1990, IEEE Standard for the Scheme Programming Language

IEEE Std 1178-1990, IEEE Standard for the Scheme Programming Language
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Natural Semantics

STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
A semantic comparison of LISP and SCHEME

LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming

Towards compatible and interderivable semantic specifications for the scheme programming language, part I: denotational semantics, natural semantics, and abstract machines

Semantics and algebraic specification
Growing solver-aided languages with rosette

Proceedings of the 2013 ACM international symposium on New ideas, new paradigms, and reflections on programming & software

Quantified Score

Hi-index	0.01

Visualization

Abstract

In the informal description of Scheme, the order of evaluating the operands and the operator of each application is unspecified. This paper presents an operational semantics for Scheme which faithfully reflects this fact. Furthermore, when the semantics is restricted so as to assume there is one unspecified order used throughout a program, the semantics is shown to be sound with respect to the denotational semantics of Scheme.