My SETL page

SETL (SET Language) is a wonderful very high-level language with special supports for sets.

From Wikipedia SETL
SETL (SET Language) is a very-high level programming language based on the mathematical theory of sets. It was originally developed by Jack Schwartz at the NYU Courant Institute of Mathematical Sciences in the late 1960s. SETL provides two basic aggregate data types: unordered sets, and sequences (the latter also called tuples). The elements of sets and tuples can be of any arbitrary type, including sets and tuples themselves. Maps are provided as sets of pairs (i.e., tuples of length 2) and can have arbitrary domain and range types. Primitive operations in SETL include set membership, union, intersection, and power set construction, among others.


Some SETL links:

My SETL programs:

My GNU SETL programs

Here are some of my (GNU) SETL programs, mostly small examples and experiments from
Project Euler, or from Rosetta Code.

2010-04-28: I blogged about (GNU) SETL and some of these programs in SETL - The SET Programming Language.

My SetlX programs

Here are some of my
SetlX programs, mostly small examples and experiments from Project Euler, or from Rosetta Code. (Many are ported from my GNU SETL programs shown above.)

Java code for SetlX

It's quite easy to add functionality in SetlX via Java code, though it requires re-compilation and re-creation of setlX.jar, i.e. it requires the source code of SetlX (e.g. SetlX_v1-1-1.devel.zip). Here's how it's done: Here are some experimental functions (some more experimental than others). Note that these files are designed so there is no need to change any of the internal files.

Back to my homepage.
Created by Hakan Kjellerstrand (hakank@bonetmail.com)