Abstract
This article describes a study evaluating the run time behavior of two functional languages, combinator-based SASL and environment-based Franz LISP, for a set of algorithms. The idea was to measure the effectiveness of the instruction set of a conventional processor and Turner's combinators as the instruction set for a processor that runs functional languages. The study shows that, statistically, the combinator-based implementation of SASL is better than the environment-based implementation of Franz LISP in space and time for at least small to medium-size input data sets.
| Original language | English |
|---|---|
| Pages (from-to) | 163-167 |
| Number of pages | 5 |
| Journal | Journal of Systems and Software |
| Volume | 20 |
| Issue number | 2 |
| DOIs | |
| State | Published - Feb 1993 |
| Externally published | Yes |
ASJC Scopus subject areas
- Software
- Information Systems
- Hardware and Architecture