Research directions in parallel functional programming (Q4936328)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1393310
Language Label Description Also known as
default for all languages
No label defined
    English
    Research directions in parallel functional programming
    scientific article; zbMATH DE number 1393310

      Statements

      26 January 2000
      0 references
      Research directions
      0 references
      Parallel functional programming
      0 references
      functional programming
      0 references
      parallel programming
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      Research directions in parallel functional programming (English)
      0 references
      On the first view it seems that sequential programs written in a (pure) functional language can be parallelized almost for free. The ``almost'' part is dealt with in this book. The first part is devoted to the theoretical foundations. It surveys various approaches to parallelism (data-driven vs. control-driven, implicit vs. explicit) in different host language environment (pure/impure, strict/nonstrict). The second part consists of a collection of results of the recent and current research. It covers data parallelism, shape theory, algorithmic skeleta, static analysis, and also touches upon complexity and performance issues. Closely related to parallelism is concurrency. Concurrent Clean provides concurrency annotations, which enable to create arbitrary process topologies. The editors made a good job selecting interesting results of the area of parallel functional programming.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references