SET Language. A very high level language based on sets, designed by Jack Schwartz at the Courant Institute in the early 1970s. It was possibly the first use of {list comprehension} notation. Data types include sets (unordered collections), tuples (ordered collections) and maps (collections of ordered pairs). Expressions may include quantifiers (' for each' and ' exists' ). The first Ada translator was written in SETL. See also ISETL, ProSet, SETL2. ["Programming With Sets - An Introduction to SETL", Jacob T. Schwartz et al, Springer 1986].

In addition suitable contents:
[ 2 ] [ = ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ ba ] [ base ] [ by ] [ C ] [ ch ] [ ck ] [ cl ] [ co ] [ com ] [ D ] [ de ] [ design ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ eh ] [ er ] [ es ] [ ET ] [ et ] [ ETL ] [ Express ] [ fi ] [ file ] [ fo ] [ for ] [ ge ] [ gh ] [ gn ] [ gr ] [ gu ] [ h ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ inc ] [ include ] [ io ] [ ir ] [ IS ] [ is ] [ ISE ] [ ISETL ] [ it ] [ J ] [ la ] [ language ] [ Lex ] [ li ] [ list ] [ list comprehension ] [ ls ] [ lu ] [ ly ] [ ma ] [ map ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ne ] [ ng ] [ no ] [ ns ] [ om ] [ pa ] [ pe ] [ ph ] [ pl ] [ pr ] [ ProSet ] [ quantifier ] [ query ] [ rc ] [ re ] [ rl ] [ ro ] [ S ] [ SE ] [ se ] [ SET ] [ set ] [ SETL2 ] [ si ] [ sig ] [ sl ] [ so ] [ st ] [ T ] [ th ] [ to ] [ tr ] [ tt ] [ tuple ] [ type ] [ tz ] [ ua ] [ up ] [ us ] [ ve ] [ wart ]