Two-level semantics and code generation

Theoretical Computer Science

Volumn 56, Issue 1, 1988, Pages 59-133

  Nielson, Flemming ^a   Nielson, Hanne Riis ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY;

CODE GENERATION; DATA FLOW ANALYSIS; INPUT-OUTPUT SEMANTICS; PASCAL-LIKE LANGUAGES; TWO-LEVEL SEMANTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0022560855     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(86)90006-X     Document Type: Article

References (46)

1. Semantics-directed code generation
2. Can programming be liberated from the Von Neumann style
3. Definable operations in general algebras, and the theory of automata and flowcharts
4. Threaded Code
5. The functional abstract machine
6. Compiling a functional language
7. The categorical abstract machine
8. Control flow treatment in a simple semantics-directed compiler generator
9. An order-algebraic definition of Knuthian semantics
10. The Scheme 311 Compiler. An exercise in denotational semantics
11. Using domain algebras to prove the correctness of a compiler
12. Compiler generation from denotational semantics
13. On the use of LISP in implementing denotational semantics
14. An algebraic definition of simulation between programs
15. Advice on structuring compilers and proving them correct
16. SIS—Semantics Implementation System: reference manual and user guide
17. A constructive approach to compiler correctness
18. Abstract semantic algebras
19. Abstract interpretation using domain theory
20. Abstract interpretation of denotational definitions
21. Expected forms of data flow analysis
22. Correctness of code generation from a two-level metalanguage
23. Code generation from two-level denotational meta-languages
24. Pragmatic aspects of two-level denotational meta-languages
25. Semantics directed compiling for functional languages
26. Towards a denotational theory of abstract interpretation
27. Compiler generation from denotational semantics
28. The category of complete partial orders: a tool for making meanings
29. Denotational semantics as a specification of code generators
30. Types, abstraction and parametric polymorphism
31. Data types as lattices
32. Lectures on a mathematical theory of computation
33. Domains for denotational semantics
34. Control flow aspects of semantics directed compiling
35. The category-theoretic solution of recursive domain equations
36. More on advice on structuring compilers and proving them correct
37. Deriving target code as a representation of continuation semantics