Category:SETL
(Redirected from SETL)
SETL
This programming language may be used to instruct a computer to perform a task.
Listed below are all of the tasks on Rosetta Code which have been solved using SETL.
This programming language may be used to instruct a computer to perform a task.
Official website |
---|
See Also: |
|
---|
SETL (SET Language) developed by Jack Schwartz at the New York University Courant Institute of Mathematical Sciences in the 1969.
SETL is the ancestor of ABC.
The first Ada compiler was written in SETL.
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- SETL examples needing attention (empty)
- SETL Implementations (1 P)
- SETL User (2 P)
Pages in category "SETL"
The following 144 pages are in this category, out of 144 total.
A
C
E
F
H
L
M
N
P
R
S
- Safe and Sophie Germain primes
- Sequence of non-squares
- Sequence: smallest number with exactly n divisors
- Set
- Set consolidation
- Show ASCII table
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Sierpinski triangle
- Sieve of Eratosthenes
- Smallest square that begins with n
- Smith numbers
- Sorting algorithms/Merge sort
- Sorting algorithms/Quicksort
- Split a character string based on change of character
- Steady squares
- Stern-Brocot sequence
- Strange plus numbers
- String length
- Strip a set of characters from a string
- Subleq
- Sum and product of an array
- Sum of a series
- Sum of first n cubes
- Sum of the digits of n is substring of n
- Symmetric difference
- System time