Compilation of functional languages using flow graph analysis

Share/Save/Bookmark

Hartel, Pieter H. and Glaser, Hugh and Wild, John M. (1994) Compilation of functional languages using flow graph analysis. Software: Practice and Experience, 24 (2). pp. 127-173. ISSN 0038-0644

open access
[img]
Preview
PDF
360kB
Abstract:A system based on the notion of a flow graph is used to specify formally and to implement a compiler for a lazy functional language. The compiler takes a simple functional language as input and generates C. The generated C program can then be compiled, and loaded with an extensive run-time system to provide the facility to experiment with different analysis techniques. The compiler provides a single, unified, efficient, formal framework for all the analysis and synthesis phases, including the generation of C. Many of the standard techniques, such as strictness and boxing analyses, have been included.
Item Type:Article
Copyright:© 1994 Wiley
Link to this item:http://purl.utwente.nl/publications/55732
Official URL:http://dx.doi.org/10.1002/spe.4380240202
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page