Skip to main content

Why Parallel Functional Programming Matters: Panel Statement

  • Conference paper
Reliable Software Technologies - Ada-Europe 2011 (Ada-Europe 2011)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6652))

Included in the following conference series:

Abstract

Parallel programming is returning to importance. Functional programming ideas offer a way to break through the barriers that restrict parallel programmers, dramatically simplifying how parallelism can be exploited. This paper explores some ideas of abstraction from functional programming, showing how functional programming offers opportunities to deal with real problems of parallelism.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hammond, K., Trinder, P.: Parallel Haskell: Lightweight Parallelism for Heavyweight Parallel Programs (2011) (in Preparation)

    Google Scholar 

  2. Trinder, P., Hammond, K., Loidl, H.W., Peyton Jones, S.: Algorithm + Strategy = Parallelism. J. of Functional Programming 8(1), 23–60 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Trinder, P.W., Hammond, K., Mattson Jr., J.S., Partridge, A.S., Peyton Jones, S.L.: Gum: a Portable Parallel Implementation of Haskell. In: Proc. PLDI 1996: ACM 1996 Conf. on Prog. Lang. Design and Implementation, pp. 79–88. ACM, New York (1996)

    Google Scholar 

  4. Marlow, S., Maier, P., Loidl, H.W., Aswad, M.K., Trinder, P.: Seq no more: better strategies for parallel haskell. In: Proceedings of the Third ACM Haskell Symposium on Haskell, Haskell 2010, pp. 91–102. ACM, New York (2010)

    Chapter  Google Scholar 

  5. Cole, M.: Algorithmic Skeletons: Structure Management of Parallel Computations. In: Research Monographs in Parallel and Distributed Computing. MIT Press, Cambridge (1989)

    Google Scholar 

  6. Peyton Jones, S. (ed.): Haskell 98 Language and Libraries: the Revised Report. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  7. Armstrong, J.: Erlang. Commun. ACM 53(9), 68–75 (2010)

    Article  Google Scholar 

  8. Petricek, T.: Real World Functional Programming With Examples in F# and C#. Manning Publications (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hammond, K. (2011). Why Parallel Functional Programming Matters: Panel Statement. In: Romanovsky, A., Vardanega, T. (eds) Reliable Software Technologies - Ada-Europe 2011. Ada-Europe 2011. Lecture Notes in Computer Science, vol 6652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21338-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21338-0_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21337-3

  • Online ISBN: 978-3-642-21338-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics