Multilisp: A language for concurrent symbolic computation. Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing parallelism. The potential complexity of dealing with side effects in a parallel context is mitigated by the nature of the parallelism constructs and by support for abstract data types: a recommended Multilisp programming style is presented which, if followed, should lead to highly parallel, easily understandable programs.

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 20 articles )

Showing results 1 to 20 of 20.
Sorted by year (citations)

  1. Din, Crystal Chang; Owe, Olaf: Compositional reasoning about active objects with shared futures (2015)
  2. Din, Crystal Chang; Owe, Olaf: A sound and complete reasoning system for asynchronous communication with shared futures (2014)
  3. Henrio, Ludovic; Kammüller, Florian; Lutz, Bianca: ASP$_\text fun$ : a typed functional active object calculus (2012)
  4. Navabi, Armand; Zhang, Xiangyu; Jagannathan, Suresh: Dependence analysis for safe futures (2012)
  5. Achten, Peter; van Eekelen, Marko; Koopman, Pieter; Morazán, Marco T.: Trends in trends in functional programming 1999/2000 versus 2007/2008 (2010)
  6. Ábrahám, Erika; Grabe, Immo; Grüner, Andreas; Steffen, Martin: Behavioral interface description of an object-oriented language with futures and promises (2009)
  7. Caromel, Denis; Henrio, Ludovic; Serpette, Bernard Paul: Asynchronous sequential processes (2009)
  8. Chen, Liang; Bairagi, Deepankar; Lin, Yuan: MCFX: a new parallel programming framework for multicore systems (2009) ioport
  9. Zhang, Lingli; Krintz, Chandra: As-if-serial exception handling semantics for Java futures (2009)
  10. Johnsen, Einar Broch; Yu, Ingrid Chieh: Backwards type analysis of asynchronous method calls (2008)
  11. Niehren, J.; Schwinghammer, J.; Smolka, G.: A concurrent lambda calculus with futures (2006)
  12. Baude, Francoise; Caromel, Denis; Sagnol, David: Distributed objects for parallel numerical applications. (2002)
  13. Jagannathan, S.: Continuation-based transformations for coordination languages (2000)
  14. Barklund, Jonas: Bounded quantifications for iteration and concurrency in logic programming (1994)
  15. Romaniuk, Steve G.; Hall, Lawrence O.: SC-net: A hybrid connectionist, symbolic system (1993)
  16. Singh, V.; Kumar, V.; Agha, G.; Tomlinson, C.: Efficient algorithms for parallel sorting on mesh multicomputers (1991)
  17. Solworth, Jon A.: Programming language constructs for highly parallel operations on lists (1988) ioport
  18. Gibert, Jacek: Functional programming with combinators (1987)
  19. Halstead, Robert H.jun.: An assessment of Multilisp: Lessons from experience (1986)
  20. Halstead, Robert H.jun.: Multilisp: A language for concurrent symbolic computation (1985)