ALGOL 68
1 program
Added 2025-11-05T11:53:17Z
Model: google/gemini-2.5-proTemp: 0.4
Evidence
Report issue
View issues
Aliases: —
Provenance: commit ed7aac3d50 · authored 2025-11-05T12:53:17+01:00 · model google/gemini-2.5-pro
Sources mentioning this language
3 sources · pl_id:
pl/algol-68-2Wikipedia 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: concurrent · imperative |
|---|---|
| Typing | static, strong, safe, structural |
| Designed by | A. van Wijngaarden · B. J. Mailloux · J. E. L. Peck · C. H. A. Koster · et al |
| First appeared | 1968 |
| Influenced by | ALGOL 60 · ALGOL Y |
| Homepage | http://algol68-lang.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.
Sieve of Eratosthenes
Provenance: commit ed7aac3d50 · authored 2025-11-05T12:53:17+01:00 · model google/gemini-2.5-pro · Temp 0.4
# Sieve of Eratosthenes - Algol 68 version #
# The original Sieve of Eratosthenes algorithm #
PROC sieve = (INT limit, REF[]BOOL primes)VOID:
BEGIN
# Initialise the array to all TRUE #
FOR i FROM LWB primes TO UPB primes DO primes[i] := TRUE OD;
# Set 0 and 1 to not be prime #
primes[0] := primes[1] := FALSE;
# For all numbers from 2 up to the square root of the limit #
FOR i FROM 2 TO ENTIER sqrt(limit) DO
# If the number is prime #
IF primes[i] THEN
# Mark all of its multiples as not prime #
FOR j FROM i*i BY i TO limit DO
primes[j] := FALSE
OD
FI
OD
END; # sieve #
# Main program #
BEGIN
INT limit = 100;
[0:limit]BOOL primes;
sieve(limit, primes);
print(("Primes up to ", limit, ":", newline));
FOR i FROM LWB primes TO UPB primes DO
IF primes[i] THEN
print((whole(i,0), " "))
FI
OD;
print(newline)
END