Modula-2+
1 program
Added 2026-03-06T10:00:00Z
Agent: claude-codeModel: claude-sonnet-4-6WebSearch: disabled
Evidence
Report issue
View issues
Aliases: Modula-2 Plus
Provenance: commit 64b38945e4 · authored 2026-03-06T09:47:07+01:00 · agent claude-code · model claude-sonnet-4-6
Sources mentioning this language
3 sources · pl_id:
pl/modula-2-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 | imperative · structured · modular · data · procedure hiding · concurrent |
|---|---|
| Typing | static, strong, safe |
| Designed by | DEC Systems Research Center (SRC) Acorn Research Center · Paul Rovner · Roy Levin · John Wick |
| First appeared | 1984 |
| Influenced by | Pascal · ALGOL · Modula-2 |
| License | Proprietary |
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.
Greatest Common Divisor and LCM
Provenance: commit 64b38945e4 · authored 2026-03-06T09:47:07+01:00 · agent claude-code · model claude-sonnet-4-6 · WebSearch disabled
MODULE GCDDemo;
(* Demonstrates GCD and LCM in Modula-2+ *)
FROM InOut IMPORT WriteInt, WriteLn, WriteString;
PROCEDURE GCD(a, b: INTEGER): INTEGER;
VAR t: INTEGER;
BEGIN
WHILE b # 0 DO
t := b;
b := a MOD b;
a := t
END;
RETURN a
END GCD;
PROCEDURE LCM(a, b: INTEGER): INTEGER;
BEGIN
RETURN (a * b) DIV GCD(a, b)
END LCM;
BEGIN
WriteString("GCD(48, 18) = "); WriteInt(GCD(48, 18), 0); WriteLn;
WriteString("GCD(100, 75) = "); WriteInt(GCD(100, 75), 0); WriteLn;
WriteString("LCM(4, 6) = "); WriteInt(LCM(4, 6), 0); WriteLn
END GCDDemo.