K
1 program
Added 2025-10-23T07:47:53Z
Model: google/gemini-2.5-proTemp: 0.4
Evidence
Report issue
View issues
Aliases: —
Provenance: commit 4a6070735e · authored 2025-10-23T09:47:53+02:00 · model google/gemini-2.5-pro
Sources mentioning this language
7 sources · pl_id:
pl/kWikipedia 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 | array · functional |
|---|---|
| Typing | dynamic, strong |
| Designed by | KX Systems · Arthur Whitney |
| First appeared | 1993 |
| Influenced by | A+ · APL · Scheme |
| Homepage | http://kx.com |
Extensions claimed by this language
1 claim. Each row is one upstream assertion with its strength.
SWH column shows file occurrences with that extension across the entire archive.| Extension | Source | Strength | SWH |
|---|---|---|---|
.k | pygments | primary | 216.8K files |
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.
Sudoku Solver
Provenance: commit 4a6070735e · authored 2025-10-23T09:47:53+02:00 · model google/gemini-2.5-pro · Temp 0.4
/ sudoku solver
/ s is 9x9 integer matrix, 0 for unknown
/ e.g. s:("i";",")0:0: `sudoku.txt
/ solve s
/
b:9 9#til 81 /box
c:9 9#b@;b /col
r:9 9#b /row
/
solve:{[s]
m:s=0;
cands:m#enlist[1+til 9] except' s[r],s[c],s[b];
if[~any m;:s];
i:first where m;
:first solve'[s,'[;i;]'cands i]
}