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].

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">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 ]