Benchmarking implementations of lazy functional languages

Pieter H. Hartel, K.G. Langendoen

    Research output: Contribution to conferencePaper

    20 Citations (Scopus)
    114 Downloads (Pure)

    Abstract

    Five implementations of different lazy functional languages are compared using a common benchmark of a dozen medium size programs. The benchmarking procedure has been designed such that one set of programs can be translated automatically into different languages, thus allowing a fair comparison of the quality of compilers for different lazy functional languages. Aspects studied include compile time, execution time, ease of programmingdetermined by the availability of certain key features
    Original languageUndefined
    Pages341-349
    Number of pages9
    Publication statusPublished - Jun 1993

    Keywords

    • IR-55741
    • EWI-1194

    Cite this