Janus
1 program
Added 2026-02-05T21:07:27Z
Agent: claude-codeModel: sonnetWebSearch: enabled
Evidence
Report issue
View issues
Aliases: —
Provenance: commit e8b081e4ac · authored 2026-02-05T22:08:09+01:00 · agent claude-code · model sonnet
Sources mentioning this language
4 sources · pl_id:
pl/janusWikipedia 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 | concurrent constraint logic |
|---|---|
| Designed by | Ken Kahn · Vijay A. Saraswat |
| First appeared | 1990 |
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.
Sorting Algorithm
Provenance: commit e8b081e4ac · authored 2026-02-05T22:08:09+01:00 · agent claude-code · model sonnet · WebSearch enabled
procedure init(int n, stack list)
local int q=0
n += 4
q+=9 push(list,q)
q+=7 push(list,q)
q+=1 push(list,q)
q+=5 push(list,q)
delocal int q=0
procedure makeidperm(int n, stack perm)
local int i=0
local int z=0
from i=0
do skip
loop push(perm,z)
perm[i] += i
i += 1
until i=n
i -= n
delocal int z=0
delocal int i=0
procedure sort(int n, stack list, stack perm)
local int i=0
local int j=0
from i = 0
do skip
loop j += n-2
from j = n-2
do skip
loop if list[j] > list[j+1]
then list[j] <=> list[j+1]
perm[j] <=> perm[j+1]
else skip
fi perm[j] > perm[j+1]
j -= 1
until j = i-1
j -= i-1
i += 1
until i = n-1
i -= n-1
delocal int j=0
delocal int i=0
procedure main(int n, stack list, stack perm)
call init(n,list)
call makeidperm(n,perm)
call sort(n,list,perm)