Stack method in program semantics (Q1085598)
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: Stack method in program semantics |
scientific article; zbMATH DE number 3982489
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stack method in program semantics |
scientific article; zbMATH DE number 3982489 |
Statements
Stack method in program semantics (English)
0 references
1987
0 references
In this paper, we describe firstly a formal concept of stack and introduce some operational rules on it. Then we extend the denotational semantics to ''the denotational semantics with stacks'', by which we make a formal semantics for a real PASCAL (subset) which can run on a computer. By an example of program with procedures it will be seen that our method can be used to describe the basic principles of compiling. Finally, we have succeeded in building a formal semantics model of a PROLOG (subset).
0 references
denotational semantics with stacks
0 references
PASCAL
0 references
PROLOG
0 references