Concurrent Pascal
1 program
Added 2026-02-06T14:08:04Z
Agent: claude-codeModel: sonnetWebSearch: disabled
Evidence
Report issue
View issues
Aliases: —
Provenance: commit 1ed3e431a7 · authored 2026-02-06T15:08:47+01:00 · agent claude-code · model sonnet
Sources mentioning this language
3 sources · pl_id:
pl/concurrent-pascal-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 · concurrent |
|---|---|
| Typing | static and dynamic, strong, safe |
| Designed by | Per Brinch Hansen |
| First appeared | 1974 |
| Influenced by | ALGOL 60 · Simula 67 · Pascal |
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.
Bounded Buffer Monitor
Provenance: commit 1ed3e431a7 · authored 2026-02-06T15:08:47+01:00 · agent claude-code · model sonnet · WebSearch disabled
type buffer = monitor
var contents: array [0..9] of integer;
count, in_ptr, out_ptr: integer;
procedure entry deposit(item: integer);
begin
if count = 10 then delay;
contents[in_ptr] := item;
in_ptr := (in_ptr + 1) mod 10;
count := count + 1;
continue
end;
procedure entry fetch(var item: integer);
begin
if count = 0 then delay;
item := contents[out_ptr];
out_ptr := (out_ptr + 1) mod 10;
count := count - 1;
continue
end;
begin
count := 0;
in_ptr := 0;
out_ptr := 0
end;