An operational semantics for Scheme
暂无分享,去创建一个
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.
[1] Uwe F. Pleban,et al. A semantic comparison of LISP and SCHEME , 1980, LISP Conference.
[2] David A. Schmidt,et al. Denotationaisemantics: a methodology for language development , 1986 .
[3] Gilles Kahn,et al. Natural Semantics , 1987, STACS.
[4] Joseph E. Stoy,et al. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .
[5] Robert Harper,et al. Typing first-class continuations in ML , 1991, POPL '91.