Transformations of denotational semantics in semantics directed compiler generation

Authors:
Veronique Royer
Affiliations:
O.N.E.R.A.-C.E.R.T.
Venue:
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Year:
1986

Citing 6
Cited 2

Initial Algebra Semantics and Continuous Algebras

Journal of the ACM (JACM)
Deriving Target Code as a Representation of Continuation Semantics

ACM Transactions on Programming Languages and Systems (TOPLAS)
Advice on structuring compilers and proving them correct

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
A Theory of Programming Language Semantics

A Theory of Programming Language Semantics
A Constructive Approach to Compiler Correctness

Proceedings of the 7th Colloquium on Automata, Languages and Programming

A realistic compiler generator based on high-level semantics: another progress report

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An Overview of Compositional Translations

COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In semantics-directed compiler generation one is faced with the problem of how to translate a source semantic definition of a programming language into on equivalent target semantics closer to an implementation. Most of the existing works solve this problem in a non constructive way : a target semantics is exhibited first and then only proved correct against the source. We try to show that target semantics can be derived from source semantics in a constructive way and so that some correctness ideas are automatically preserved. The framework is denotational semantics.