Detecting global variables in denotational specifications
- 1 April 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 7 (2) , 299-310
- https://doi.org/10.1145/3318.3323
Abstract
Sufficient criteria are given for replacing all occurrences of the store argument in a Scott-Strachey denotational definition of a programming language by a single global variable. The criteria and transformation are useful for transforming denotational definitions into compilers and interpreters for imperative machines, for optimizing applicative programs, and for judging the suitability of semantic notations for describing imperative languages. An example transformation of a semantics of a repeat-loop language to one which uses a global store variable is given to illustrate the technique.Keywords
This publication has 6 references indexed in Scilit:
- Deriving Target Code as a Representation of Continuation SemanticsACM Transactions on Programming Languages and Systems, 1982
- First-order identities as a defining languageActa Informatica, 1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- A constructive approach to compiler correctnessPublished by Springer Nature ,1980
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Proof of correctness of data representationsActa Informatica, 1972