Pop-11

1 program Added 2025-10-28T16:01:48Z Model: x-ai/grok-4-fastTemp: 0.4 Evidence Report issue View issues
Aliases: Pop11
Provenance: commit 90e465f665 · authored 2025-10-28T17:01:49+01:00 · model x-ai/grok-4-fast

Sources mentioning this language

4 sources · pl_id: pl/pop-11
LLM (this repo) · 1PldbWikipediaWikidata · Q7120001

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 · reflective · procedural · functional · declarative
Typingdynamic
Designed byUniversity of Sussex Systems Designers Ltd. Integral Solutions Ltd. University of Birmingham · Robin Popplestone · Steve Hardy · Chris Mellish · Aaron Sloman · John Williams · Robert Duncan · Simon Nichols · John Gibson
First appeared1975
Influenced byPOP-2
LicenseProprietary (1975–1999) Open-source (1999–present): MIT – XFree86
Implemented inPOP-11
Homepagehttp://www.cs.bham.ac.uk/research/projects/poplog/poplog.info.html

Related languages

POP-1 (0.50)PL-11 (0.29)POP-2 (0.24)Poplog (0.19)Popr (0.18)

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.

Pairs of numbers summing to 11

Provenance: commit 90e465f665 · authored 2025-10-28T17:01:49+01:00 · model x-ai/grok-4-fast · Temp 0.4
code.p · added: 2025-10-28T16:01:48Z
vars x, y;
for x from 1 to 10 do
  for y from 1 to 10 do
    if x + y = 11 then
      pr(x, ' + ', y, ' = 11\n');
    endif;
  endfor
endfor

Contribute — propose a file extension

Tell us where to find evidence about Pop-11 (mapped to pl/pop-11). 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/Pop-11/programs/<sha>/. Keep under ~200 lines.
(or open the pre-filled issue directly)
← POP-1 POP-2 →