From Surf Wiki (app.surf) — the open knowledge base

MultiLisp

Field	Value
name	MultiLisp
logo
screenshot
paradigms	Multi-paradigm: functional, imperative, concurrent, meta
family	Lisp
designer	Robert H. Halstead Jr.
developer	Massachusetts Institute of Technology (MIT
released
latest release date
typing	Dynamic, latent, strong
scope	Lexical
programming language	Interlisp
discontinued	Yes
platform	Concert multiprocessor
license	Proprietary
file format
website
influenced by	Lisp, Scheme
influenced	Gambit, Interlisp-VAX

MultiLisp is a functional programming language, a dialect of the language Lisp, and of its dialect Scheme, extended with constructs for parallel computing execution and shared memory. These extensions involve side effects, rendering MultiLisp nondeterministic. Along with its parallel-programming extensions, MultiLisp also had some unusual garbage collection and task scheduling algorithms. Like Scheme, MultiLisp was optimized for symbolic computing. Unlike some parallel programming languages, MultiLisp incorporated constructs for causing side effects and for explicitly introducing parallelism.

It was designed by Robert H. Halstead Jr., in the early 1980s for use on the 32-processor Concert multiprocessor then being developed at Massachusetts Institute of Technology (MIT) and implemented in Interlisp. It influenced the development of the Scheme dialects Gambit, and Interlisp-VAX.

PCALL and FUTURE

MultiLisp achieves parallelism with the PCALL macro, where

(PCALL Fun A B C ...)

is equivalent to

(Fun A B C ...)

except that the arguments A, B, C, etc. are explicitly allowed to be evaluated in parallel; this circumvents the usual order of evaluation, which is sequential and left to right. It also makes use of a parallel programming construct called futures, which resembles forking, combined with lazy evaluation. Using this construct, an expression such as

(cons (FUTURE A) (FUTURE B))

can be written, which will overlap the evaluation of the expressions A and B, not only with each other, but with computations that use the result of the cons call, until an operation is performed that needs correct information about the value of A or B.

References

WikiSysop. (2019-02-06). "Gambit".

Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

concurrent-programming-languages dynamically-typed-programming-languages functional-languages lisp-programming-language-family multi-paradigm-programming-languages

Want to explore this topic further?

Ask Mako anything about MultiLisp — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report