SETL
E51023
SETL is a high-level programming language developed in the late 1960s that is notable for its powerful set-theoretic abstractions and influence on later language design.
Aliases (1)
- SETL2 ×1
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
high-level programming language
→
programming language → |
| academicOrigin |
Courant Institute of Mathematical Sciences
→
|
| countryOfOrigin |
United States
→
|
| designedBy |
Jack Schwartz
→
|
| designedFor |
expressing algorithms close to mathematical notation
→
|
| developedAt |
New York University
→
|
| developmentStartDate |
late 1960s
→
|
| executionModel |
interpreted
→
|
| hasFeature |
backtracking constructs
→
first-class maps → first-class sets → first-class tuples → iterators over sets → nondeterministic programming constructs → quantified expressions → set comprehensions → |
| hasSuccessor |
SETL2
→
SETLX → |
| influenced |
ABC (programming language)
→
Python (programming language) → SETL2 → SETLX → very-high-level language design → |
| influencedBy |
mathematical notation
→
set theory → |
| levelOfAbstraction |
very high-level
→
|
| notableFor |
mathematical notation style
→
set-theoretic abstractions → support for maps as a primitive data type → support for sets as a primitive data type → support for tuples as a primitive data type → |
| paradigm |
imperative programming
→
procedural programming → set-theoretic programming → |
| primaryDomain |
algorithm specification
→
rapid prototyping → |
| supports |
associative maps
→
finite sets → ordered tuples → set membership tests → set operations such as difference → set operations such as intersection → set operations such as union → |
| typingDiscipline |
dynamically typed
→
|
| usedIn |
research on programming language design
→
|
Referenced by (2)
| Subject (surface form when different) | Predicate |
|---|---|
|
SETL
("SETL2")
→
|
influenced |
|
ABC programming language
→
|
influencedBy |