Skip to main content

Concurrency Design Patterns

  • Chapter
  • First Online:
Practical Concurrent Haskell

Abstract

In this chapter, we have chosen to present the most common problems that could occur in big data applications. One of best solutions to these problems is to use design patterns. Research contributions in functional programming continue to be made in this area, including attempts to make functional versions of OOP design patterns. Haskell is a very good programming language for big data, but some of patterns have implementations only in object-oriented programing languages. This is not an impediment for using both Haskell and design patterns, however, because they could be easily made interoperable, as you will see in this chapter. A good design pattern reference is Design Patterns: Elements of Reusable Object-Oriented Software by Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides (also known as the Gang of Four) (Addison-Wesley Professional, 1994).

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 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.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

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Stefania Loredana Nita and Marius Mihailescu

About this chapter

Cite this chapter

Nita, S.L., Mihailescu, M. (2017). Concurrency Design Patterns. In: Practical Concurrent Haskell. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-2781-7_11

Download citation

Publish with us

Policies and ethics