Detecting stack-based environments in denotational definitions (Q1112581)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Detecting stack-based environments in denotational definitions |
scientific article; zbMATH DE number 4078757
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Detecting stack-based environments in denotational definitions |
scientific article; zbMATH DE number 4078757 |
Statements
Detecting stack-based environments in denotational definitions (English)
0 references
1988
0 references
We present a statically checkable, sufficient, syntactic criterion for implementing the environment argument in a denotational definition as a global stack variable. We also show how such an environment can be implemented as a compile-time symbol table. If the denotational definition also supports a global store variable, the store can be implemented as run-time primary storage, and a conventional compile/\(evaluate\) implementation results. In addition to its value for implementation, the criterion is useful for understanding the relationship between functional and imperative programming language styles. We present two examples.
0 references
compiling
0 references
functional programming language
0 references
denotational definition
0 references
global stack variable
0 references
compile-time symbol
0 references
global store variable
0 references
imperative programming language
0 references