Parallel and Concurrent Programming in Haskell

Parallel and Concurrent Programming in Haskell

EnglishPaperback / softback
Marlow Simon
O'Reilly Media
EAN: 9781449335946
On order
Delivery on Friday, 3. of July 2026
€36.44
Common price €40.49
Discount 10%
pc
Do you want this product today?
Oxford Bookshop Banská Bystrica
not available
Oxford Bookshop Bratislava
not available
Oxford Bookshop Košice
not available

Detailed information

If you have a working knowledge of Haskell, this hands-on book shows you how to use the language's many APIs and frameworks for writing both parallel and concurrent programs. You'll learn how parallelism exploits multicore processors to speed up computation-heavy programs, and how concurrency enables you to write programs with threads for multiple interactions. Author Simon Marlow walks you through the process with lots of code examples that you can run, experiment with, and extend. Divided into separate sections on Parallel and Concurrent Haskell, this book also includes exercises to help you become familiar with the concepts presented: Express parallelism in Haskell with the Eval monad and Evaluation Strategies Parallelize ordinary Haskell code with the Par monad Build parallel array-based computations, using the Repa library Use the Accelerate library to run computations directly on the GPU Work with basic interfaces for writing concurrent code Build trees of threads for larger and more complex programs Learn how to build high-speed concurrent network servers Write distributed programs that run on multiple machines in a network
EAN 9781449335946
ISBN 1449335942
Binding Paperback / softback
Publisher O'Reilly Media
Publication date September 17, 2013
Pages 256
Language English
Dimensions 179 x 232 x 17
Country United States
Authors Marlow Simon
Illustrations w. figs.
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.