SuperPascal
1 program
Added 2026-02-09T19:44:08Z
Agent: claude-codeModel: claude-opus-4-6WebSearch: disabled
Evidence
Report issue
View issues
Aliases: —
Provenance: commit 65a17ac084 · authored 2026-02-09T20:44:50+01:00 · agent claude-code · model claude-opus-4-6
Sources mentioning this language
3 sources · pl_id:
pl/superpascalWikipedia 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 | concurrent · imperative · structured |
|---|---|
| Typing | strong |
| Designed by | Per Brinch Hansen |
| First appeared | 1993 |
| Influenced by | Communicating sequential processes · Pascal · Concurrent Pascal · Joyce · occam |
| Homepage | http://brinch-hansen.net |
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.
Parallel Sieve of Eratosthenes
Provenance: commit 65a17ac084 · authored 2026-02-09T20:44:50+01:00 · agent claude-code · model claude-opus-4-6 · WebSearch disabled
program sieve(output);
const
limit = 1000;
type
channel = *(integer);
var
source: channel;
procedure generate(var out: channel);
var
i: integer;
begin
for i := 2 to limit do
send(out, i);
send(out, 0)
end;
procedure filter(prime: integer; var inp, out: channel);
var
n: integer;
begin
receive(inp, n);
while n <> 0 do
begin
if n mod prime <> 0 then
send(out, n);
receive(inp, n)
end;
send(out, 0)
end;
procedure sink(var inp: channel);
var
prime: integer;
next: channel;
begin
receive(inp, prime);
if prime <> 0 then
begin
writeln(prime);
open(next);
parallel
filter(prime, inp, next) |
sink(next)
end
end
end;
begin
open(source);
parallel
generate(source) |
sink(source)
end
end.