Run-time behavior of SASL programs: A performance study

Authors:
S. Mansoor Sarwar
Affiliations:
Multnomah School of Engineering, University of Portland, 5000 N. Willamette Blvd, Portland, OR 97203-5798, U.S.A.
Venue:
Computer Languages
Year:
1993

Citing 3
Cited 0

Statistics on graph reduction of SASL programs

Software—Practice & Experience
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Super-combinators a new implementation method for applicative languages

LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the results of a study to measure the performance of various searching and sorting algorithms, and the combinatory behavior of the SASL (St. Andrew's Static Language) run-time system for a wide range of algorithms, abstract data types and programming styles. The study shows that sequential algorithms perform much better than non-sequential algorithms in the SASL environment. The study also shows that there are families and strings of combinators that are used frequently. Optimization of such combinators promises an efficient sequential reduction machine based upon the combinator model.