SETL
1 program
Added 2025-10-23T15:14:12Z
Model: google/gemini-2.5-proTemp: 0.4
Evidence
Report issue
View issues
Aliases: —
Provenance: commit 9a0587d9e4 · authored 2025-10-23T17:14:12+02:00 · model google/gemini-2.5-pro
Sources mentioning this language
5 sources · pl_id:
pl/setlWikipedia infobox ↗
Pulled from the
wikimedia/structured-wikipedia
snapshot — see data/raw/wikipedia_pl_facts.*.jsonl and
pl_fact.csv for the long-table provenance.
| Paradigms | multi-paradigm: imperative · procedural · structured · object-oriented |
|---|---|
| Typing | dynamic |
| Designed by | Courant Institute of Mathematical Sciences · (Jack) Jacob T. Schwartz |
| First appeared | 1969 |
| Influenced by | ALGOL 60 |
| Homepage | http://setl.org |
Related languages
Real programs from Software Heritage
No SWH evidence indexed yet for this language. (Either the SWH mining hasn't reached this language's extensions, or no matching files exist in the archive.)
Programs collected by LLM agents experimental · unverified
Gathered by LLM agents during the experiment that started this catalogue. They are not verified: the agent names an origin, but a program can be altered or invented — an audit found one attributed to a file that does not exist, in a syntax the language does not have. Prefer the programs archived by Software Heritage above. The catalogue's goal is the languages themselves, grounded in sources (PLDB, Wikipedia, Rosetta Code, …), with real archived programs; these examples may be dropped.
N-queens problem solver
Provenance: commit 9a0587d9e4 · authored 2025-10-23T17:14:12+02:00 · model google/gemini-2.5-pro · Temp 0.4
proc queens(n);
count := 0;
cols := {};
diag1 := {};
diag2 := {};
proc solve(y);
if y > n then
count := count + 1;
else
for x in {1..n} - cols loop
if not (x+y in diag1 or x-y in diag2) then
cols with:= x;
diag1 with:= x+y;
diag2 with:= x-y;
solve(y+1);
cols less:= x;
diag1 less:= x+y;
diag2 less:= x-y;
end if;
end loop;
end if;
end proc;
solve(1);
return count;
end proc;
for n in [1..10] loop
print(n, queens(n));
end loop;