Abstract
An application language developed at St Andrews University during the period 1972–76. Is higher order, has all type-checking delayed until run-time (thus permitting the definition of functions with arbitrary polymorphism). supports non-strict functions and infinite data structures, has pattern-matching on lists and nested block structure using Landin’s “where”. Was probably the first language to systematically exploit the power of lazy evaluation. Also of interest is the implementation technique for SASL developed later at the University of Kent, which involves compilation to combinatory logic and has proved considerably more efficient than the earlier implementation based on an SECD machine. The combinators implementation of SASL runs under Unix. See also KRC <114>.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Turner, D.A. SASL Language Manual. Technical Report. St Andrews University. December. 1976. Revised edition from University of Kent. August 1979.
Turner, D.A. A New Implementation Technique for Applicative Languages. Software — Practice and Experience. 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bundy, A., Wallen, L. (1984). SASL. In: Bundy, A., Wallen, L. (eds) Catalogue of Artificial Intelligence Tools. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96868-6_222
Download citation
DOI: https://doi.org/10.1007/978-3-642-96868-6_222
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13938-6
Online ISBN: 978-3-642-96868-6
eBook Packages: Springer Book Archive