MultiLisp
1 program
Added 2026-02-10T14:25:30Z
Agent: claude-codeModel: claude-opus-4-6WebSearch: disabled
Evidence
Report issue
View issues
Aliases: Multi-Lisp
Provenance: commit 2975e5676e · authored 2026-02-10T15:26:11+01:00 · agent claude-code · model claude-opus-4-6
Sources mentioning this language
3 sources · pl_id:
pl/multilispWikipedia 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 · imperative · concurrent · meta |
|---|---|
| Typing | dynamic, latent, strong |
| Designed by | Massachusetts Institute of Technology (MIT · Robert H. Halstead Jr |
| First appeared | 1980 |
| Influenced by | Lisp · Scheme |
| License | Proprietary |
| Implemented in | Interlisp |
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 Fibonacci
Provenance: commit 2975e5676e · authored 2026-02-10T15:26:11+01:00 · agent claude-code · model claude-opus-4-6 · WebSearch disabled
;;; Parallel Fibonacci in MultiLisp
;;; Demonstrates the 'future' construct for implicit parallelism
(define (pfib n)
(if (< n 2)
n
(let ((a (future (pfib (- n 1))))
(b (future (pfib (- n 2)))))
(+ a b))))
(define (sequential-fib n)
(if (< n 2)
n
(+ (sequential-fib (- n 1))
(sequential-fib (- n 2)))))
;;; Parallel map using futures
(define (pmap f lst)
(if (null? lst)
'()
(let ((head (future (f (car lst))))
(tail (future (pmap f (cdr lst)))))
(cons head tail))))
;;; Example: compute squares in parallel
(define (square x) (* x x))
(define (main)
(display "Parallel Fibonacci:")
(newline)
(do ((i 0 (+ i 1)))
((= i 10))
(display (pfib i))
(display " "))
(newline)
(display "Parallel map (squares of 1-5): ")
(display (pmap square '(1 2 3 4 5)))
(newline))
(main)