The programming language SETL is a relatively new member of the so-called "very-high-level" class of languages, some of whose other well-known mem bers are LISP, APL, SNOBOL, and PROLOG. These languages all aim to reduce the cost of programming, recognized today as a main obstacle to future progress in the computer field, by allowing direct manipulation of large composite objects, considerably more complex than the integers, strings, etc., available in such well-known mainstream languages as PASCAL, PL/I, ALGOL, and Ada. For this purpose, LISP introduces structured lists as data objects, APL introduces vectors and matrices, and SETL introduces the objects characteristic for it, namely general finite sets and maps. The direct availability of these abstract, composite objects, and of powerful mathematical operations upon them, improves programmer speed and pro ductivity significantly, and also enhances program clarity and readability. The classroom consequence is that students, freed of some of the burden of petty programming detail, can advance their knowledge of significant algorithms and of broader strategic issues in program development more rapidly than with more conventional programming languages.
Authors and Affiliations
Computer Science Department, Courant Institute of Mathematical Sciences, New York University, New York, USA
J. T. Schwartz,
R. B. K. Dewar,
E. Schonberg
Department of Mathematics and Computer Science, Clarkson University, Potsdam, USA
E. Dubinsky
Bibliographic Information
Book Title: Programming with Sets
Book Subtitle: An Introduction to SETL
Authors: J. T. Schwartz, R. B. K. Dewar, E. Schonberg, E. Dubinsky
