Benchmarking implementations of lazy functional languages II -- Two years later

Share/Save/Bookmark

Hartel, P.H. (1995) Benchmarking implementations of lazy functional languages II -- Two years later. In: 7th Implementation of Functional Languages, Marstrand, Sweden (pp. pp. 63-68).

open access
[img]
Preview
PDF
147kB
Abstract:Six implementations of different lazy functional languages are compared using a common benchmark of a dozen medium-sized programs. The experiments that were carried out two years ago have been repeated to chart progress in the development of these compilers. The results have been extended to include all three major Haskell compilers. Over the last two years, the Glasgow Haskell compiler has been improved considerably. The other compilers have also been improved, but to a lesser extent. The Yale Haskell compiler is slower than the Glasgow and Chalmers Haskell compilers. The compilation speed of the Clean compiler is still unrivalled. Another extension is a comparison of results on different architectures so as to look at architectural influences on the benchmarking procedure. A high-end architecture should be avoided for benchmarking activities, as its behaviour is uneven. It is better to use a midrange machine if possible.
Item Type:Conference or Workshop Item
Link to this item:http://purl.utwente.nl/publications/55712
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page