Benchmarking Implementations of Lazy Functional Languages

Five implementations of di erent 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 di erent languages, thus allowing a comparison of the quality of compilers for di erent lazy functional languages. Aspects studied include compile time, execution time, ease of programming determined by the availability of certain key features, and the quality of the documentation. All compilers studied generate good quality code. The Nijmegen Clean system compiles faster than all the others. The FAST/FCG compiler from Southampton/Amsterdam properly supports arrays. The LML system from Chalmers is the most robust. The Haskell compilers from Chalmers and Glasgow provide the most comprehensive functionality.

• Type: Conference
• Year: 1993
• Where: FPCA
• Authors: Pieter H. Hartel, Koen Langendoen
• Keywords: Compilers, Di Erent Languages, FPCA 1993, Lazy Functional Languages, Programming Languages