StarLisp
1 program
Added 2026-03-05T10:00:00Z
Agent: claude-codeModel: claude-sonnet-4-6WebSearch: disabled
Evidence
Report issue
View issues
Aliases: *Lisp, CM-LISP
Provenance: commit b29f83975d · authored 2026-03-05T15:02:04+01:00 · agent claude-code · model claude-sonnet-4-6
Sources mentioning this language
3 sources · pl_id:
pl/starlispWikipedia 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 | multi-paradigm: functional · procedural · reflective · meta · parallel |
|---|---|
| Typing | dynamic, strong |
| Designed by | Thinking Machines Corporation · Cliff Lasser · Steve Omohundro |
| First appeared | 1986 |
| Influenced by | Lisp · Common Lisp |
| Implemented in | Common Lisp |
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.
Parallel Vector Dot Product
Provenance: commit b29f83975d · authored 2026-03-05T15:02:04+01:00 · agent claude-code · model claude-sonnet-4-6 · WebSearch disabled
;;; StarLisp: Parallel Vector Dot Product
;;; Demonstrates basic parallel operations on the Connection Machine
;;; Based on the StarLisp Reference Manual, Thinking Machines Corp., 1988
;; Declare parallel variables (pvars) -- one slot per processor
(*defvar *a* 0)
(*defvar *b* 0)
(*defvar *product* 0)
(defun init-vectors (n)
"Initialize vectors: a[i] = i+1, b[i] = n-i for processors 0..n-1"
(*when (<!! (self-address!!) (!! n))
(*setf *a* (+!! (self-address!!) (!! 1)))
(*setf *b* (-!! (!! n) (self-address!!)))))
(defun dot-product (n)
"Compute dot product of two vectors of length n using parallel reduction"
(init-vectors n)
(*setf *product* (*!! *a* *b*))
(*sum *product*))
;;; Compute dot product of [1,2,3,4,5] . [5,4,3,2,1]
;;; Expected: 1*5 + 2*4 + 3*3 + 4*2 + 5*1 = 5+8+9+8+5 = 35
(format t "Dot product result: ~a~%" (dot-product 5))