Effective Haskell: Ch. 3 and Ch. 4 typos

Ch. 3

  • In all Haskell executable → executables

Ch. 4

  • structured collection → collections
  • I’ ll send a letter - spurious space
  • Instead, of directly mixing - remove comma
  • we can define a MaybeInt → garbled sentence, maybe “by defining”.
  • The firs part of our parser → first
  • definition of stringParser all together → altogether
  • Parsing a string by extracting - lowercase “parsing”
  • This lets use easily reuse → lets us
  • we’ll looks at a couple → look

The last one is not a typo. The BinaryTree definition is incorrect. For example, there is no way to create a tree containing exactly 2 leaves.

We could use instead:

data BinaryTree a = Empty | Branch (BinaryTree a) a (BinaryTree a)

1 Like