Two-level semantics and code generation (Q1095636): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4152697 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Can programming be liberated from the von Neumann style? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Programming languages and their definition. Selected papers ed. by C. B. Jones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3721820 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3657413 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An order-algebraic definition of knuthian semantics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3785893 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3677148 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the power of list iteration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5639839 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4133080 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4068067 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4066567 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3664406 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3718128 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3709882 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3718132 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3709854 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3713560 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Data Types as Lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3664454 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3959414 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Control Flow Aspects of Semantics-Directed Compiling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Category-Theoretic Solution of Recursive Domain Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3914393 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: More on advice on structuring compilers and proving them correct / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deriving Target Code as a Representation of Continuation Semantics / rank | |||
Normal rank |
Revision as of 12:37, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two-level semantics and code generation |
scientific article |
Statements
Two-level semantics and code generation (English)
0 references
1988
0 references
We present a two-level denotational metalanguage that is suitable for defining the semantics of PASCAL-like languages. The two levels allow for an explicit distinction between computations taking place at compile-time and computations taking place at run-time. While this distinction is perhaps not absolutely necessary for describing the input-output semantics of programming languages, it is necessary when issues like data flow analysis and code generation are considered. For an example stack- machine we show how to generate code for the run-time computations and still perform the compile-time computations. Based on an example it is argued that compiler-tricks like the use of activation records suggest how to cope with certain syntactic restrictions in the metalanguage. The correctness of the code generation is proved using Kripke-like relations and using a modified machine that can be made to loop when a certain level of recursion is encountered.
0 references
two-level denotational metalanguage
0 references
semantics of PASCAL-like languages
0 references
compile-time
0 references
run-time
0 references
data flow analysis
0 references
correctness
0 references
Kripke-like relations
0 references
loop
0 references
recursion
0 references