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 language | Undefined |
---|---|
Pages | 341-349 |
Number of pages | 9 |
Publication status | Published - Jun 1993 |
Event | 6th Functional programming languages and computer architecture (FPCA), Copenhagen, Denmark - Duration: 1 Jan 1993 → 1 Jan 1993 |
Other
Other | 6th Functional programming languages and computer architecture (FPCA), Copenhagen, Denmark |
---|---|
Period | 1/01/93 → 1/01/93 |
Keywords
- IR-55741
- EWI-1194