Affordable Access

Benchmarking implementations of lazy functional languages

Publication Date
  • Computer Science
  • Design


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

There are no comments yet on this publication. Be the first to share your thoughts.