Function definition by special cases in GHCi

by

To use those definition in GHCi exactly as they were written (i.e. with multiple equations or type signatures in separate lines), you need to use multiline input in GHCi through the :{ and :} delimiters:

GHCi> :{
GHCi| foo 0 = print 999
GHCi| foo n = print n
GHCi| :}
GHCi> foo 0
999

One alternative would be turing on multiline input for the rest of your session with the +m option. In this case, though, you also need an explicit let, as without it GHCi won’t figure out you want to continue the definition:

GHCi> :set +m
GHCi> let foo 0 = print 999
GHCi|     foo n = print n
GHCi| 
GHCi> foo 0
999

(You can turn +m off with :unset +m.)

Yet another possibility is eschewing line breaks altogether, and using explicit braces and semicolons:

GHCi> foo 0 = print 999; foo n = print n
GHCi> foo 0
999

Between the multiline input options, I personally prefer :{ and :} over +m, as they require less changes with respect to how I usually phrase my definitions, and are more likely to work straight away if I paste code from somewhere else.

As for why your way of entering it didn’t work, it was because, unless you use multiline input, bindings to the same name in separate GHCi lines shadow each other:

GHCi> x = 3
GHCi> x = 4
GHCi> x
4

This seems less surprising if we note that we get the same behaviour from a chain of let-expressions:

GHCi> let x = 3 in let x = 4 in x
4

More Related Contents:

  1. How to define a function in ghci across multiple lines?
  2. :sprint for polymorphic values?
  3. Multi-line commands in GHCi
  4. Prefix form of unary operator in Haskell
  5. What is the difference between . (dot) and $ (dollar sign)?
  6. Good examples of Not a Functor/Functor/Applicative/Monad?
  7. Haskell ranges and floats
  8. Small Haskell program compiled with GHC into huge binary
  9. DatatypeContexts Deprecated in Latest GHC: Why?
  10. What does the exclamation mark mean in a Haskell declaration?
  11. Haskell function composition operator of type (c→d) → (a→b→c) → (a→b→d)
  12. Unwrapping a monad
  13. Haskell: Lists, Arrays, Vectors, Sequences
  14. What are “n+k patterns” and why are they banned from Haskell 2010?
  15. How do I write, “if typeclass a, then a is also an instance of b by this definition.”
  16. Haskell read raw keyboard input
  17. Currying 3 Arguments in Haskell
  18. Should do-notation be avoided in Haskell?
  19. Why doesn’t Haskell sequence these IO actions properly?
  20. Why doesn’t this function work if I use “[xs]” instead of “xs”?
  21. What is fusion in Haskell?
  22. What does the `forall` keyword in Haskell/GHC do?
  23. How does deriving work in Haskell?
  24. Foldr/Foldl for free when Tree is implementing Foldable foldMap?
  25. What characters are permitted for Haskell operators?
  26. Converting IO Int to Int
  27. Convert String to Integer/Float in Haskell?
  28. Haskell – depth for each node in binary tree using Reader monad
  29. Explanation of “tying the knot”
  30. Return specific type within Haskell

Leave a Comment