Advertisement

SASL

  • Alan Bundy
  • Lincoln Wallen
Part of the Symbolic Computation book series (SYMBOLIC)

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>.

Keywords

Implementation Technique Combinatory Logic Early Implementation Language Manual Intelligence Tool 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [Turner 76]
    Turner, D.A. SASL Language Manual. Technical Report. St Andrews University. December. 1976. Revised edition from University of Kent. August 1979.Google Scholar
  2. [Turner 79]
    Turner, D.A. A New Implementation Technique for Applicative Languages. Software — Practice and Experience. 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Alan Bundy
    • 1
  • Lincoln Wallen
  1. 1.Department of Artificial IntelligenceEdinburgh UniversityEdinburghScotland

Personalised recommendations