Control Flow Aspects of Semantics-Directed Compiling

Sethi, Ravi

doi:10.1145/69575.357227

Cited by 38 publications

(7 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As for semantics-implementation systems, there have been many [1,14,20,26,29,31,34,35,37,41,43,46,47,48], and they were all quite complicated. (Note: this list of references is by no means exhaustive.…”

Section: Denotational Semantics and Semantics-implementation Systemsmentioning

confidence: 99%

Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation

Danvy¹,

Vestergaard²

1996

BRICS

View full text Add to dashboard Cite

We illustrate a simple and effective solution to semantics-based compiling. Our solution is based on type-directed partial evaluation, where• our compiler generator is expressed in a few lines, and is efficient;• its input is a well-typed, purely functional definitional interpreter in the manner of denotational semantics; • the output of the generated compiler is three-address code, in the fashion and efficiency of the Dragon Book; • the generated compiler processes several hundred lines of source code per second.The source language considered in this case study is imperative, blockstructured, higher-order, call-by-value, allows subtyping, and obeys stack discipline. It is bigger than what is usually reported in the literature on semantics-based compiling and partial evaluation. Our compiling technique uses the first Futamura projection, i.e., we compile programs by specializing a definitional interpreter with respect to this program.Our definitional interpreter is completely straightforward, stackbased, and in direct style. In particular, it requires no clever staging technique (currying, continuations, binding-time improvements, etc.), nor does it rely on any other framework (attribute grammars, annotations, etc.) than the typed λ-calculus. In particular, it uses no other program analysis than traditional type inference.The overall simplicity and effectiveness of the approach has encouraged us to write this paper, to illustrate this genuine solution to denotational semantics-directed compilation, in the spirit of Scott and

show abstract

Section: Denotational Semantics and Semantics-implementation Systemsmentioning

confidence: 99%

Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation

Danvy¹,

Vestergaard²

1996

BRICS

View full text Add to dashboard Cite

show abstract

“…The task of specifying control flow in terms of syntax is addressed by Sethi's plumb project [16]. In essence, plumb allows a continuation passing style semantics to be specified for a programming language using a special function composition operator.…”

Section: Previous Workmentioning

confidence: 99%

Flow grammars — a flow analysis methodology

Uhl

Horspool

1994

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This introduction of explicit labels and jumps has also been used in the context of semantics-directed compiling [3,27]. The application of the linearization process to the previous expression yields:…”

Section: Linearizationmentioning

confidence: 99%

Compilation of functional languages by program transformation

Fradet

Métayer

1991

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

One of the most important issues concerning functional languages is the efficiency and the correctness of their implementation.We focus on sequential implementations for conventional von Neumann computers. The compilation process is described in terms of program transformations in the functional framework. The original functional expression is transformed into a functional term that can be seen as a traditional machine code. The two main steps are the compilation of the computation rule by the introduction of continuation functions and the compilation of the environment management using combinators. The advantage of this approach is that we do not have to introduce an abstract machine, which makes correctness proofs much simpler. As far as efficiency is concerned, this approach is promising since many optimization can be described and formally justified in the functional framework.

show abstract

Control Flow Aspects of Semantics-Directed Compiling

Cited by 38 publications

References 29 publications

Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation

Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation

Flow grammars — a flow analysis methodology

Compilation of functional languages by program transformation

Contact Info

Product

Resources

About