Book Image

Haskell High Performance Programming

By : Samuli Thomasson
Book Image

Haskell High Performance Programming

By: Samuli Thomasson

Overview of this book

Haskell, with its power to optimize the code and its high performance, is a natural candidate for high performance programming. It is especially well suited to stacking abstractions high with a relatively low performance cost. This book addresses the challenges of writing efficient code with lazy evaluation and techniques often used to optimize the performance of Haskell programs. We open with an in-depth look at the evaluation of Haskell expressions and discuss optimization and benchmarking. You will learn to use parallelism and we'll explore the concept of streaming. We’ll demonstrate the benefits of running multithreaded and concurrent applications. Next we’ll guide you through various profiling tools that will help you identify performance issues in your program. We’ll end our journey by looking at GPGPU, Cloud and Functional Reactive Programming in Haskell. At the very end there is a catalogue of robust library recommendations with code samples. By the end of the book, you will be able to boost the performance of any app and prepare it to stand up to real-world punishment.
Table of Contents (21 chapters)
Haskell High Performance Programming
Credits
About the Author
About the Reviewer
www.PacktPub.com
Preface
Index

Combining events and behaviors


Events and behaviors are the core foundation of FRP in Reactive-banana. Behaviors can be composed via the Applicative interface, but numerous other ways are also provided by the Reactive-banana API. Some primitives are provided:

never :: Event a

unionWith
  :: (a -> a -> a) -> Event a  -> Event a -> Event a

filterE
  :: (a -> Bool) -> Event a -> Event a

apply
  :: Behavior (a -> b)  -> Event a -> Event b

It's apparent from the types what these functions do. unionWith combines two events using the first argument to decide the result in case of simultaneous emits. filterE suppresses events that don't match a predicate. apply applies a time-varying function to events. Often apply is encountered in its infix form, (<@>).

A special case of apply is replacing events with time-varying values. The (<@) combinator can be used in this case. For example, to turn every event from etick into a random value sampled from behavior...