An application language developed at St Andrews University during the period 1972–76. Is higher order, has alltype-checking delayed until run-time (thus permitting the definition of functions with arbitrary polymorphism). supports non-strict functions and infinite data structures, haspattern-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>.

Authors and Affiliations

1. Department of Artificial Intelligence, Edinburgh University, Hope Park Square, Meadow Lane, Edinburgh, EH8 9NW, Scotland

   Alan Bundy

Editors and Affiliations

1. Department of Artificial Intelligence, Edinburgh University, Hope Park Square, Meadow Lane, Edinburgh, EH8 9NW, Scotland

   Alan Bundy

Reprints and permissions

© 1984 Springer-Verlag Berlin Heidelberg

Policies and ethics