List of showables OOP-style in Haskell?

by

Since evaluation is lazy in Haskell, how about just creating a list of the actual strings?

showables = [ show 1, show "blah", show 3.14 ]

Related Contents:

  1. A monad is just a monoid in the category of endofunctors, what’s the problem?
  2. What is Weak Head Normal Form?
  3. Comparing Haskell’s Snap and Yesod web frameworks
  4. What is the purpose of the reader monad?
  5. Does GHC-mod have to use full names for types?
  6. Shorthand way for assigning a single field in a record, while copying the rest of the fields?
  7. Does Haskell require a garbage collector?
  8. How is this fibonacci-function memoized?
  9. Haskell error parse error on input `=’
  10. What is called and what does it do? [closed]
  11. mtl, transformers, monads-fd, monadLib, and the paradox of choice
  12. What is Levity polymorphism
  13. How to read this GHC Core “proof”?
  14. Divide Int to Int and return Int
  15. Difference between print and putStrLn in Haskell
  16. Profiling builds with Stack
  17. Haskell: how to map a tuple?
  18. How does non-strict and lazy differ?
  19. What is the difference between Pattern Matching and Guards?
  20. Haskell Weird Kinds: Kind of (->) is ?? -> ? -> *
  21. How do you use Control.Applicative to write cleaner Haskell?
  22. Defining a new monad in haskell raises no instance for Applicative
  23. Existential vs. Universally quantified types in Haskell
  24. Curry-Howard isomorphism
  25. runST and function composition
  26. Haskell’s ($) is a magic operator?
  27. What does the : infix operator do in Haskell?
  28. What does (f .) . g mean in Haskell?
  29. Accessing members of a custom data type in Haskell
  30. How are lists implemented in Haskell (GHC)?
  31. Future of roles for GADT-like type variables?
  32. Can I constrain a type family?
  33. Explanation of “tying the knot”
  34. Is there a type ‘Any’ in haskell?
  35. Is Haskell suitable as a first language?
  36. Why is catching an exception non-pure, but throwing an exception is pure?
  37. When is the difference between quotRem and divMod useful?
  38. Is there any reason not to use the INLINABLE pragma for a function?
  39. Is everything in Haskell stored in thunks, even simple values?
  40. Accessing a Specific Element in a Tuple
  41. What is the connection between laziness and purity?
  42. Why should Applicative be a superclass of Monad?
  43. What is fusion in Haskell?
  44. Real world use of GADT
  45. Is there a Haskell code formatter?
  46. Haskell tuple constructor (GHC) and the separation between a language and its implementation
  47. Restricting string literals to Text only
  48. Lazy evaluation of terms in an infinite list in Haskell
  49. How do you identify monadic design patterns?
  50. Haskell syntax for ‘or’ in case expressions

Leave a Comment