SETL
| Paradigm | multi-paradigm: imperative, procedural, structured, object-oriented |
|---|---|
| Designed by | (Jack) Jacob T. Schwartz |
| Developer | Courant Institute of Mathematical Sciences |
| First appeared | 1969 |
| Stable release |
1.1 / January 7, 2005
|
| Typing discipline | Dynamic |
| Website | setl |
| Influenced by | |
| ALGOL 60 | |
| Influenced | |
| ProSet, ABC, Slim | |
SETL (SET Language) is a very high-level programming language based on the mathematical theory of sets. It was originally developed by (Jack) Jacob T. Schwartz at the New York University (NYU) Courant Institute of Mathematical Sciences in the late 1960s.
SETL provides two basic aggregate data types: unordered sets, and sequences (the latter also called tuples). The elements of sets and tuples can be of any arbitrary type, including sets and tuples themselves. Maps are provided as sets of pairs (i.e., tuples of length 2) and can have arbitrary domain and range types. Primitive operations in SETL include set membership, union, intersection, and power set construction, among others.
SETL provides quantified boolean expressions constructed using the universal and existential quantifiers of first-order predicate logic.
SETL provides several iterators to produce a variety of loops over aggregate data structures.
Print all prime numbers from 2 to N:
The notation is similar to list comprehension.
A factorial procedure definition:
A more conventional SETL expression for factorial (n > 0):
In the 1970s, SETL was ported to the BESM-6, ES EVM and other Russian computer systems.
SETL was used for an early implementation of the programming language Ada, named the NYU Ada/ED translator. This later became the first validated Ada implementation, certified on April 11, 1983.
Python's predecessor, ABC, was inspired by SETL -- Lambert Meertens spent a year with the SETL group at NYU before coming up with the final ABC design!
...
Wikipedia