Advertisement

Programming with Sets

An Introduction to SETL

  • J. T. Schwartz
  • R. B. K. Dewar
  • E. Schonberg
  • E. Dubinsky

Part of the Texts and Monographs in Computer Science book series (MCS)

Table of contents

  1. Front Matter
    Pages i-xv
  2. J. T. Schwartz, R. B. K. Dewar, E. Schonberg, E. Dubinsky
    Pages 1-24
  3. J. T. Schwartz, R. B. K. Dewar, E. Schonberg, E. Dubinsky
    Pages 25-47
  4. J. T. Schwartz, R. B. K. Dewar, E. Schonberg, E. Dubinsky
    Pages 48-102
  5. J. T. Schwartz, R. B. K. Dewar, E. Schonberg, E. Dubinsky
    Pages 103-158
  6. J. T. Schwartz, R. B. K. Dewar, E. Schonberg, E. Dubinsky
    Pages 159-238
  7. J. T. Schwartz, R. B. K. Dewar, E. Schonberg, E. Dubinsky
    Pages 239-308
  8. J. T. Schwartz, R. B. K. Dewar, E. Schonberg, E. Dubinsky
    Pages 309-322
  9. J. T. Schwartz, R. B. K. Dewar, E. Schonberg, E. Dubinsky
    Pages 323-344
  10. J. T. Schwartz, R. B. K. Dewar, E. Schonberg, E. Dubinsky
    Pages 345-371
  11. J. T. Schwartz, R. B. K. Dewar, E. Schonberg, E. Dubinsky
    Pages 372-403
  12. J. T. Schwartz, R. B. K. Dewar, E. Schonberg, E. Dubinsky
    Pages 404-466
  13. Back Matter
    Pages 467-493

About this book

Introduction

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.

Keywords

Action Clean Debugging Rack SETL Turing algorithms data structures programming quality assurance testing verification

Authors and affiliations

  • J. T. Schwartz
    • 1
  • R. B. K. Dewar
    • 1
  • E. Schonberg
    • 1
  • E. Dubinsky
    • 2
  1. 1.Computer Science Department, Courant Institute of Mathematical SciencesNew York UniversityNew YorkUSA
  2. 2.Department of Mathematics and Computer ScienceClarkson UniversityPotsdamUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4613-9575-1
  • Copyright Information Springer-Verlag New York 1986
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4613-9577-5
  • Online ISBN 978-1-4613-9575-1
  • Series Print ISSN 0172-603X
  • Buy this book on publisher's site