Higher-Order and Symbolic Computation

, Volume 11, Issue 2, pp 125–143

A Generalization of Jumps and Labels

Authors

  • Peter J. Landin
    • QMWUniversity of London
Article

DOI: 10.1023/A:1010068630801

Cite this article as:
Landin, P.J. Higher-Order and Symbolic Computation (1998) 11: 125. doi:10.1023/A:1010068630801

Abstract

This paper describes a new language feature that is a hybrid of labels and procedures. It is closely related to jumping out of a functional subroutine, and includes conventional labels and jumping as a special, but probably not most useful, case. It is independent of assignment, ie., it can be added to a “purely-functional” (“non-imperative”) system (such as LISP without pseudo-functions or program feature). Experiments in purely functional programming suggest that its main use will be in success/failure situations, and failure actions. This innovation is incorporated in the projected experimental system, ISWIM.

Copyright information

© Kluwer Academic Publishers 1998