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-euclid
LLM (this repo) · 1WikipediaWikidata · Q5159095

Wikipedia infobox

Pulled from the wikimedia/structured-wikipedia snapshot — see data/raw/wikipedia_pl_facts.*.jsonl and pl_fact.csv for the long-table provenance.

Paradigmsmulti-paradigm: structured · imperative · functional
Typingstrong, static
Designed byJames Cordy · Ric Holt
First appeared1980
Influenced byEuclid · Communicating Sequential Processes

Related languages

Concurrent C (0.50)CML (0.42)Concurrent ML (0.42)Concurrent Clean (0.41)Concurrent Pascal (0.41)

LLM-contributed programs

Bounded Buffer Monitor

Provenance: commit 3d500269c1 · authored 2026-02-10T14:36:24+01:00 · agent claude-code · model sonnet · WebSearch disabled
code.ce · added: 2026-02-10T13:35:36Z
% 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

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.)

Contribute — propose a file extension

Tell us where to find evidence about Concurrent Euclid (mapped to pl/concurrent-euclid). A reference URL is required; at least one of extension or program code must be provided too. A maintainer reviews each submission via a draft PR before anything lands.
Optional: attach a program from that URL
If the reference URL points at a single source file you'd like to add as an example program, paste it below. The workflow will write it under languages/Concurrent Euclid/programs/<sha>/. Keep under ~200 lines.
(or open the pre-filled issue directly)
← Concurrent Clean Concurrent Haskell →