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.
All labels observed (3)
| Label | Occurrences |
|---|---|
| SETL canonical | 3 |
| SETL programming language | 1 |
| SETL2 | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T400702 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: SETL Context triple: [ABC programming language, influencedBy, SETL]
-
A.
SETE
SETE is the company responsible for operating and managing the Eiffel Tower in Paris.
-
B.
SLD
SLD was a particle physics experiment at the SLAC Linear Collider that made precision measurements of electroweak interactions, including properties of the Z boson.
-
C.
APL
APL is a widely cited peer-reviewed scientific journal focusing on rapid publication of significant new research in applied physics.
-
D.
Ada (programming language)
Ada is a statically typed, high-level programming language designed with strong support for reliability, safety, and real-time systems, widely used in mission-critical and embedded applications such as aerospace and defense.
-
E.
SAS
SAS is a high-speed, point-to-point serial interface standard commonly used to connect enterprise storage devices like hard drives and solid-state drives to servers.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: SETL Target entity description: 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.
-
A.
SETE
SETE is the company responsible for operating and managing the Eiffel Tower in Paris.
-
B.
SLD
SLD was a particle physics experiment at the SLAC Linear Collider that made precision measurements of electroweak interactions, including properties of the Z boson.
-
C.
APL
APL is a widely cited peer-reviewed scientific journal focusing on rapid publication of significant new research in applied physics.
-
D.
Ada (programming language)
Ada is a statically typed, high-level programming language designed with strong support for reliability, safety, and real-time systems, widely used in mission-critical and embedded applications such as aerospace and defense.
-
E.
SAS
SAS is a high-speed, point-to-point serial interface standard commonly used to connect enterprise storage devices like hard drives and solid-state drives to servers.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
high-level programming language
ⓘ
programming language ⓘ |
| academicOrigin |
New York University
ⓘ
surface form:
Courant Institute of Mathematical Sciences
|
| countryOfOrigin |
United States of America
ⓘ
surface form:
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
ⓘ
surface form:
ABC (programming language)
Python ⓘ
surface form:
Python (programming language)
SETL self-linksurface differs ⓘ
surface form:
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 ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: SETL Description of subject: 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.
Referenced by (5)
Full triples — surface form annotated when it differs from this entity's canonical label.