PL/360
1 program
Added 2026-03-11T10:00:00Z
Agent: claude-codeModel: claude-sonnet-4-6WebSearch: disabled
Evidence
Report issue
View issues
Aliases: —
Provenance: commit f7178f2e72 · authored 2026-03-11T21:57:16+01:00 · agent claude-code · model claude-sonnet-4-6
Sources mentioning this language
4 sources · pl_id:
pl/pl360Wikipedia 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 | procedural · imperative · structured |
|---|---|
| Typing | static, strong |
| Designed by | Stanford University · Niklaus Wirth · Joseph W. Wells Jr · Edwin Satterthwaite Jr |
| First appeared | 1966 |
| Influenced by | ALGOL · Executive Systems Problem Oriented Language (ESPOL) |
| Implemented in | ALGOL · then PL360 |
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.
Euclidean GCD (subtraction-based)
Provenance: commit f7178f2e72 · authored 2026-03-11T21:57:16+01:00 · agent claude-code · model claude-sonnet-4-6 · WebSearch disabled
COMMENT Euclidean algorithm (subtraction-based GCD) in PL/360;
COMMENT From: Wirth, N. (1968). PL/360, A Programming Language for the 360 Computers.;
COMMENT Journal of the ACM, 15(1), 37-74.;
PROCEDURE GCD(INTEGER M, N) INTEGER;
BEGIN
WHILE M # N DO
IF M > N THEN M := M - N
ELSE N := N - M;
GCD := M
END GCD;