Compilation of functional languages using flow graph analysis

Pieter H. Hartel, Hugh Glaser, John M. Wild

    Research output: Contribution to journalArticleAcademicpeer-review

    9 Citations (Scopus)
    134 Downloads (Pure)


    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.
    Original languageUndefined
    Pages (from-to)127-173
    Number of pages47
    JournalSoftware : practice and experience
    Issue number2
    Publication statusPublished - Feb 1994


    • IR-55732
    • EWI-1168

    Cite this