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).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-1-4842-2781-7_11
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-2780-0
Online ISBN: 978-1-4842-2781-7
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books