What indentation is required for a case statement within a let statement?

by

The basic indentation rules are actually quite simple:

  • after the keywords which start a block (where,let,do,case .. of) note down the column where the next word starts (which might be in the next line)
  • lines indented exactly as that are new entries in the block
  • lines indented more than that continue the previous entry
  • a line indented less than that ends the block right before that line
  • in nested blocks, apply the rules to the outermost block, first

Tricky example:

1 + case x of
      A -> 45  -- note where "A" starts
      B -> 10  -- same indentation: another case branch
       + 2     -- more indented, so it's "10+2"
     + 10      -- less indented, so it's "1+(case ...)+10"

In your case,

let b' = case True of
    True -> True
    False -> False

we have two nested blocks, one for let and one for case..of. The let blocks uses the column of b'. The case..of block tries to reuse the same column, but we need to apply the rules the the outermost block, first. So the True -> ... line is actually a new entry of the let block. This triggers a parsing error.

More Related Contents:

  1. Why shouldn’t I mix tabs and spaces?
  2. How do I deal with many levels of indentation?
  3. Should do-notation be avoided in Haskell?
  4. Expressing do block using only monadic bind syntax
  5. `String’ is applied to too many type arguments
  6. How do I define Lisp’s apply in Haskell?
  7. Operating on a return from a Maybe that contains “Just”
  8. Is there a Haskell idiom for updating a nested data structure?
  9. What’s so bad about Lazy I/O?
  10. Positive integer type
  11. Explicitly import instances
  12. Large-scale design in Haskell? [closed]
  13. Splitting list into a list of possible tuples
  14. What is the purpose of the reader monad?
  15. Haskell: I/O and Returning From a Function
  16. Ordering of parameters to make use of currying
  17. No instance for (Fractional Int) arising from a use of `/’
  18. Type Constraints in Data Declaration Haskell
  19. Prefix form of unary operator in Haskell
  20. How can I generate different random values in Haskell?
  21. Can you overload + in haskell?
  22. Non-Trivial Lazy Evaluation
  23. Is there a way to see the list of functions in a module, in GHCI?
  24. Haskell GHC: what is the time complexity of a pattern match with N constructors?
  25. Creating unique labels in Haskell
  26. Tools for analyzing performance of a Haskell program
  27. Haskell Constraint is no smaller than the instance head
  28. Can I match a data constructor wildcard in Haskell?
  29. Is there, in Haskell, something similar to sub-guards?
  30. What is the Comonad typeclass in Haskell?

Leave a Comment