SETL2
E258609
SETL2 is a successor version of the SETL programming language, designed to extend and modernize its set-theoretic, high-level approach to algorithm specification and implementation.
All labels observed (1)
| Label | Occurrences |
|---|---|
| SETL2 canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2314149 — 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.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: SETL2 Context triple: [SETL, hasSuccessor, SETL2]
-
A.
SETL
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.
-
B.
SETLX
SETLX is a modern, open-source programming language designed for teaching and experimenting with set theory and mathematical concepts through executable code.
-
C.
Modula-2
Modula-2 is a systems programming language designed by Niklaus Wirth that extends Pascal with modules, concurrency features, and low-level facilities for structured, efficient software development.
-
D.
NTL
NTL was a major UK cable television and telecommunications company that became part of Virgin Media following a series of mergers and rebrandings.
-
E.
Oberon-2
Oberon-2 is an object-oriented, statically typed programming language that extends Niklaus Wirth’s Oberon with features like type-bound procedures and read-only export while preserving simplicity and efficiency.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: SETL2 Target entity description: SETL2 is a successor version of the SETL programming language, designed to extend and modernize its set-theoretic, high-level approach to algorithm specification and implementation.
-
A.
SETL
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.
-
B.
SETLX
SETLX is a modern, open-source programming language designed for teaching and experimenting with set theory and mathematical concepts through executable code.
-
C.
Modula-2
Modula-2 is a systems programming language designed by Niklaus Wirth that extends Pascal with modules, concurrency features, and low-level facilities for structured, efficient software development.
-
D.
NTL
NTL was a major UK cable television and telecommunications company that became part of Virgin Media following a series of mergers and rebrandings.
-
E.
Oberon-2
Oberon-2 is an object-oriented, statically typed programming language that extends Niklaus Wirth’s Oberon with features like type-bound procedures and read-only export while preserving simplicity and efficiency.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
SETL dialect
ⓘ
programming language ⓘ |
| basedOn | SETL ⓘ |
| dataType |
integer
ⓘ
map ⓘ real number ⓘ sequence ⓘ set ⓘ string ⓘ tuple ⓘ |
| designPhilosophy |
close to mathematical notation
ⓘ
emphasis on clarity of algorithms ⓘ high-level abstraction over data structures ⓘ |
| executionModel | interpreted ⓘ |
| goal |
extend SETL
ⓘ
modernize SETL ⓘ support algorithm implementation ⓘ support algorithm specification ⓘ |
| hasFeature |
conditional control constructs
ⓘ
dynamic typing ⓘ garbage collection ⓘ iterative control constructs ⓘ map-oriented operations ⓘ pattern-based iteration over sets ⓘ rich built-in data structures ⓘ set-oriented operations ⓘ |
| influencedBy |
original SETL language
ⓘ
set theory ⓘ |
| paradigm |
high-level programming
ⓘ
imperative programming ⓘ procedural programming ⓘ set-theoretic programming ⓘ |
| supports |
exception handling
ⓘ
functions ⓘ generic programming style ⓘ iterators ⓘ list comprehensions ⓘ maps as first-class data type ⓘ modules ⓘ procedures ⓘ sequences as first-class data type ⓘ set comprehensions ⓘ sets as first-class data type ⓘ tuples as first-class data type ⓘ |
| typingDiscipline | dynamic typing ⓘ |
| useCase |
experimental language design
ⓘ
rapid prototyping of algorithms ⓘ teaching algorithms ⓘ |
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.
Instruction
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.
Input
Subject: SETL2 Description of subject: SETL2 is a successor version of the SETL programming language, designed to extend and modernize its set-theoretic, high-level approach to algorithm specification and implementation.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.