SETL2: Difference between revisions
Created page with "SET Language 2 (SETL2), a backward incompatible descendant of SETL, was created by Kirk Snyder of the Courant Institute of Mathematical Sciences at New York University in the ..." |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
SET Language 2 (SETL2), a backward incompatible descendant of SETL, was created by Kirk Snyder of the Courant Institute of Mathematical Sciences at New York University in the late 1980s. Like its predecessor, it is based on the theory and notation of finite sets, but has also been influenced in syntax and style by the Ada language. | SET Language 2 (SETL2), a backward incompatible descendant of SETL, was created by Kirk Snyder of the Courant Institute of Mathematical Sciences at New York University in the late 1980s. Like its predecessor, it is based on the theory and notation of finite sets, but has also been influenced in syntax and style by the Ada language. | ||
==Publications== | |||
*W. Kirk Snyder: ''The SETL2 Programming Language'' - 1990 [https://archive.org/download/setl2programming00snyd/setl2programming00snyd.pdf] | |||
==Links== | ==Links== | ||
* [ | * [http://cd.textfiles.com/hobbesos2/ALL/PROGRAM/SETL2.ZIP SETL2.ZIP] | ||
[[Category: | [[Category:Programming Languages]] | ||
Latest revision as of 05:27, 7 November 2020
SET Language 2 (SETL2), a backward incompatible descendant of SETL, was created by Kirk Snyder of the Courant Institute of Mathematical Sciences at New York University in the late 1980s. Like its predecessor, it is based on the theory and notation of finite sets, but has also been influenced in syntax and style by the Ada language.
Publications
- W. Kirk Snyder: The SETL2 Programming Language - 1990 [1]