Book Image

Soar with Haskell

By : Tom Schrijvers
Book Image

Soar with Haskell

By: Tom Schrijvers

Overview of this book

With software systems reaching new levels of complexity and programmers aiming for the highest productivity levels, software developers and language designers are turning toward functional programming because of its powerful and mature abstraction mechanisms. This book will help you tap into this approach with Haskell, the programming language that has been leading the way in pure functional programming for over three decades. The book begins by helping you get to grips with basic functions and algebraic datatypes, and gradually adds abstraction mechanisms and other powerful language features. Next, you’ll explore recursion, formulate higher-order functions as reusable templates, and get the job done with laziness. As you advance, you’ll learn how Haskell reconciliates its purity with the practical need for side effects and comes out stronger with a rich hierarchy of abstractions, such as functors, applicative functors, and monads. Finally, you’ll understand how all these elements are combined in the design and implementation of custom domain-specific languages for tackling practical problems such as parsing, as well as the revolutionary functional technique of property-based testing. By the end of this book, you’ll have mastered the key concepts of functional programming and be able to develop idiomatic Haskell solutions.
Table of Contents (23 chapters)
Free Chapter
1
Part 1:Basic Functional Programming
6
Part 2: Haskell-Specific Features
11
Part 3: Functional Design Patterns
16
Part 4: Practical Programming

Parametric polymorphism

While we have so far been focusing on custom ADTs and functions that process them, there are actually other functions that do not care about the type of values they are processing. Such functions are (parametrically) polymorphic.

The identity function

One of the most trivial functions is the identity function, which just returns its input. What should be the type of this function? It works on any possible type of input. Thus we could create many copies of this function, one for each type we want to use it with:

idInt :: Int -> Int
idInt x = x
idBool :: Bool -> Bool
idBool x = x
idChar :: Char -> Char
idChar x = x

However, this leads to an unfortunate duplication of essentially the same logic. Moreover, our job is never done, as we would have to write another copy whenever we create a new ADT. Hence, instead, Haskell allows us to write a single generic definition that simultaneously works at all types:

Prelude
id :: a -> a
id x = x
...