Flat Concurrent Prolog

Aliases: FCP

Provenance: commit 31861d468f · authored 2026-02-23T21:06:53+01:00 · agent claude-code · model claude-sonnet-4-6

1 source · not in taxonomy (canonical name didn't match any upstream)

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. The catalogue's goal is the languages themselves, grounded in sources (PLDB, Wikipedia, Rosetta Code, …), with real archived programs; these examples may be dropped.

counter(In) :-
    counter(In,0).

counter(In,_) :-
  In =?= [clear|In'] |
    counter(In',0).
counter(In,C) :-
  In =?= [increment|In'] |
    C' := C + 1,
    counter(In',C').
counter(In,C) :-
  In =?= [read(V)|In'] |
    V = C,
    counter(In',C).
counter(In,_) :-
  In =?= [] | true.