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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
