Benchmarking implementations of lazy functional languages


Share/Save/Bookmark

Hartel, P.H. and Langendoen, K.G. (1993) Benchmarking implementations of lazy functional languages. In: 6th Functional programming languages and computer architecture (FPCA), Copenhagen, Denmark (pp. pp. 341-349).

open access
[img]
Preview
PDF
238kB
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
Item Type:Conference or Workshop Item
Copyright:©1993 ACM
Link to this item:http://purl.utwente.nl/publications/55741
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page