JOSS
1 program
Added 2025-11-12T09:16:34Z
Model: google/gemini-2.5-proTemp: 0.4
Evidence
Report issue
View issues
Aliases: —
Provenance: commit 1a125c1330 · authored 2025-11-12T10:16:34+01:00 · model google/gemini-2.5-pro
Sources mentioning this language
4 sources · pl_id:
pl/jossWikipedia 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 | non-structured · procedural · imperative |
|---|---|
| Designed by | RAND Corporation · Cliff Shaw |
| First appeared | 1963 |
| Implemented in | assembly language |
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.
Prime Number Generator
Provenance: commit 1a125c1330 · authored 2025-11-12T10:16:34+01:00 · model google/gemini-2.5-pro · Temp 0.4
1.1 Type "PRIME NUMBER GENERATOR".
1.2 Type "This program computes and types all prime numbers".
1.3 Type "less than or equal to a given number, N.".
1.4 Type " ".
1.5 Demand N.
1.6 Do part 2 for i=2,3,5:N.
1.7 Type " ".
1.8 Type "Done.".
2.1 Let j=sqrt(i).
2.2 Do part 3 for k=2,3,5:j.
2.3 Type i in form 1.
3.1 Let m=fp(i/k).
3.2 Done if m=0.
Form 1:
_._