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

Answers

  1. A semigroup is an s type with a (<>) binary associative operator. In Haskell, it is modeled by the following type class:
    class Semigroup s where
        (<>) :: s -> s -> s

    This is subject to the following associativity law:

(x <> y) <> z = x <> (y <> z)
  1. A monoid is a semigroup (that is, type m with a (<>) binary associate operator) that also has a neutral element (aka identity), mempty. In Haskell, it is modeled by the following subclass of Semigroup:
    class Semigroup m => Monoid m where
        mempty :: m

    This is subject to the two identity laws:

x <> mempty = x
mempty <> x = x
  1. The following table lists examples from the standard libraries we have covered. The first column gives the names of the types (possibly subject to type class constraints). The second column lists the names of the newtype wrappers, in case there are multiple possibilities for the...