Picolisp
1 program
Added 2025-10-22T14:20:43Z
Model: anthropic/claude-3.5-sonnetTemp: 0.4
Evidence
Report issue
View issues
Aliases: PicoLisp, Pico Lisp
Provenance: commit c56489d41a · authored 2025-10-22T16:20:43+02:00 · model anthropic/claude-3.5-sonnet
Sources mentioning this language
7 sources · pl_id:
pl/picolispWikipedia 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 | functional · procedural · object-oriented · declarative · reflective · meta |
|---|---|
| Typing | duck, dynamic, strong |
| Designed by | Alexander Burger |
| First appeared | 1988 |
| License | MIT |
| Implemented in | LLVM · PicoLisp |
| Homepage | http://picolisp.com |
Extensions claimed by this language
2 claims. 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 |
|---|---|---|---|
.l | linguist | primary | 1.0M files |
.l | wikipedia | proposed | 1.0M files |
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.
Conway's Game of Life in PicoLisp
Provenance: commit c56489d41a · authored 2025-10-22T16:20:43+02:00 · model anthropic/claude-3.5-sonnet · Temp 0.4
(de life (Size Grid Steps)
(let Grid (if Grid @ (need (* Size Size) (fill '((T . NIL)))))
(for I Steps
(disp Grid Size)
(wait 500)
(setq Grid
(make
(for (Y . @) Size
(link
(for (X . @) Size
(link
(let Sum
(sum
'((Y X)
(+ (get Grid (mod (+ Y -1) Size) (mod (+ X -1) Size))
(get Grid (mod (+ Y -1) Size) X)
(get Grid (mod (+ Y -1) Size) (mod (+ X 1) Size))
(get Grid Y (mod (+ X -1) Size))
(get Grid Y (mod (+ X 1) Size))
(get Grid (mod (+ Y 1) Size) (mod (+ X -1) Size))
(get Grid (mod (+ Y 1) Size) X)
(get Grid (mod (+ Y 1) Size) (mod (+ X 1) Size)) ) ) )
(or (and (= Sum 3) 1)
(and (= Sum 2) (get Grid Y X)) ) ) ) ) ) ) ) ) ) )
(de disp (Grid Size)
(for (Y . @) Size
(for (X . @) Size
(prin (if (get Grid Y X) "[]" " .") ) )
(prinl) ) )Disambiguation rules
Linguist heuristic rules that predict this language when one of its claimed extensions is shared with another.
| Rule | Ext | Kind | Predicates (truncated) |
|---|---|---|---|
h/linguist/.l/3 | .l | predicates | [{"kind": "any", "regexes": ["^\\((de|class|rel|code|data|must)\\s"]}] |