Generating Efficient Code From Data-Flow Programs (1991)
| Venue: | In Third International Symposium on Programming Language Implementation and Logic Programming |
| Citations: | 24 - 3 self |
BibTeX
@INPROCEEDINGS{Halbwachs91generatingefficient,
author = {Nicolas Halbwachs and Pascal Raymond and Christophe Ratel},
title = {Generating Efficient Code From Data-Flow Programs},
booktitle = {In Third International Symposium on Programming Language Implementation and Logic Programming},
year = {1991},
pages = {207--218}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper presents the techniques applied in compiling the synchronous dataflow language Lustre. The most original technique consists in synthesising an efficient control structure, by simulating the behavior of boolean variables at compiletime. Here, the techniques are explained on a small subset of Lustre. 1 Introduction Many authors [Kah74, Gra82, PP83, AW85] have advocated the advantages of data-flow languages, mainly due to their mathematical soundness, the ease of formal program construction and transformation and the absence of side effects. However, no such language is actually used, mainly because no good compilers exist for standard machines. The absence of assignment and control structures makes it difficult to produce efficient code from a data-flow program. We have argued elsewhere [BCHP86, CPHP87] that the declarative style allowed by data-flow languages makes them especially suitable for a class of real time programs: such programs can be found in domains (automatic co...
