Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Haskell Design Patterns
  • Toc
  • feedback
Haskell Design Patterns

Haskell Design Patterns

By : Lemmer
4.1 (9)
close
Haskell Design Patterns

Haskell Design Patterns

4.1 (9)
By: Lemmer

Overview of this book

Design patterns and idioms can widen our perspective by showing us where to look, what to look at, and ultimately how to see what we are looking at. At their best, patterns are a shorthand method of communicating better ways to code (writing less, more maintainable, and more efficient code) This book starts with Haskell 98 and through the lens of patterns and idioms investigates the key advances and programming styles that together make "modern Haskell". Your journey begins with the three pillars of Haskell. Then you'll experience the problem with Lazy I/O, together with a solution. You'll also trace the hierarchy formed by Functor, Applicative, Arrow, and Monad. Next you'll explore how Fold and Map are generalized by Foldable and Traversable, which in turn is unified in a broader context by functional Lenses. You'll delve more deeply into the Type system, which will prepare you for an overview of Generic programming. In conclusion you go to the edge of Haskell by investigating the Kind system and how this relates to Dependently-typed programming
Table of Contents (9 chapters)
close

Folding over lists


Recall the following from Chapter 1, Functional Patterns – the Building Blocks:

  sumLazy [] = 0
  sumLazy (x:xs) = x + sumLazy xs

Lazy recursion is captured by foldr:

  sumLazy' = foldr (+) 0

On the other hand, foldl captures tail recursion, for example consider a strict recursive sum:

  sumStrict acc [] = acc
  sumStrict acc (x:xs) = sumStrict (acc + x) xs

This is captured by the iterative process foldl:

sumStrict' = foldl (+)

The foldl function is tail recursive and strict in the accumulator. The foldr function is non-tail recursive and lazy. In fact, foldl is a special case of foldr (https://wiki.haskell.org/Foldl_as_foldr).

Folding with monadic functions

Let's write a tail-recursive sum that does some IO at each accumulation step:

  doSumStrict :: (Show a, Num a) => a -> [a] -> IO a

  doSumStrict acc [] = return acc
  doSumStrict acc (x:xs) = do 
    putStrLn $ " + " ++ (show x) ++ " = " ++ (show acc') 
    doSumStrict acc' xs
    where acc' = acc + x

  main = doSumStrict...

Unlock full access

Continue reading for free

A Packt free trial gives you instant online access to our library of over 7000 practical eBooks and videos, constantly updated with the latest in tech
bookmark search playlist font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete