Semantics of combinations in scheme

Authors:
S. Anglade;J. J. Lacrampe;C. Queinnec
Affiliations:
-;-;-
Venue:
ACM SIGPLAN Lisp Pointers
Year:
1994

Citing 3
Cited 0

Revised report on the algorithmic language scheme

ACM SIGPLAN Lisp Pointers
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

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

Proceedings of the 9th Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a denotational semantics for the combinations of the Scheme language. Scheme leaves unspecified the order of evaluation of the terms of a combination. Our purpose is to formally and denotationally characterize such indeterminacy. We achieve this by extending the denotation as well as the domain of final answers to take into account the various possible orders of evaluation.