Denotational Semantics of Programming Languages and Compiler Generation in PowerEpsilon

Abstract

Programming in constructive type theory corresponds to theorem proving in mathematics: the specification plays the role of the proposition to be proved and the program is obtained from the proof. In this paper, we present an approach of using constructive type theory to derive a compiler of a given programming language from its denotational semantic definition. The development is supported by a proof development system called <b>PowerEpsilon</b>.

DOI: 10.1145/609769.609777

Extracted Key Phrases

1 Figure or Table

Cite this paper

@article{Zhu2001DenotationalSO, title={Denotational Semantics of Programming Languages and Compiler Generation in PowerEpsilon}, author={Ming-Yuan Zhu}, journal={SIGPLAN Notices}, year={2001}, volume={36}, pages={39-53} }