Concurrent Euclid
1 program
Added 2026-02-10T13:35:36Z
Agent: claude-codeModel: sonnetWebSearch: disabled
Evidence
Report issue
View issues
Aliases: —
Provenance: commit 3d500269c1 · authored 2026-02-10T14:36:24+01:00 · agent claude-code · model sonnet
Sources mentioning this language
3 sources · pl_id:
pl/concurrent-euclidWikipedia 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: structured · imperative · functional |
|---|---|
| Typing | strong, static |
| Designed by | James Cordy · Ric Holt |
| First appeared | 1980 |
| Influenced by | Euclid · Communicating Sequential Processes |
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 3d500269c1 · authored 2026-02-10T14:36:24+01:00 · agent claude-code · model sonnet · WebSearch disabled
% Bounded Buffer Monitor in Concurrent Euclid
% A classic producer-consumer synchronization example
module BoundedBuffer
exports
procedure deposit (item : integer)
procedure remove (var item : integer)
const
bufferSize = 10
var
buffer : array 1 .. bufferSize of integer
count : integer := 0
in_ptr : integer := 1
out_ptr : integer := 1
procedure deposit (item : integer)
begin
% Wait until buffer is not full
while count = bufferSize do
delay
end while
buffer[in_ptr] := item
in_ptr := (in_ptr mod bufferSize) + 1
count := count + 1
end deposit
procedure remove (var item : integer)
begin
% Wait until buffer is not empty
while count = 0 do
delay
end while
item := buffer[out_ptr]
out_ptr := (out_ptr mod bufferSize) + 1
count := count - 1
end remove
end BoundedBuffer