SETL (SET Language) is a programming language developed by Jacob T. Schwartz at New York University beginning in 1969, built around finite sets and mappings as its primary, native data structures rather than arrays or records, allowing algorithms to be expressed at a level of abstraction close to their mathematical, set-theoretic description. SETL's set-based, high-level notation influenced later language features found in Python, such as set and dictionary comprehensions, and SETL itself is historically notable as the language in which the first working prototype compiler for the Ada programming language was written.
Facts
Classification
Typing Discipline First Released Connections
Follows Typing Discipline
In Field
Influenced
ABC's aggregate types (sets, bags, tables) were based on SETL's.
Source Wikidata: JSON
Influenced By
Invented By
Source Programming Language Database (PLDB): SETL
Sources
1. Wikidata: SETL
- Wikidata Q2205923, class allow-list match (w-wdresolver-0926)
- Wikidata Q2205923 P7078 (typing discipline)
- Influenced By: ALGOL
View the SourceWikidata: JSON
Programming Language Database (PLDB): SETL
Programming Language Database (PLDB)Invented By: Jacob T. Schwartz, Page leadQuote, Invented By: Jacob T. Schwartz, Page lead
created in 1969 by Jacob T. Schwartz
SETL (Wikipedia)
In Field: Programming Language Theory, Lead sentence
SETL (SET Language) is a very high-level programming language based on the mathematical theory of sets.
In Group: Very High-Level Languages, Lead
SETL (SET Language) is a very high-level programming language based on the mathematical theory of sets.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.