Is there a function to flatten a nested list of elements?

by

Yes, it’s concat from the Standard Prelude, given by

concat :: [[a]] -> [a]
concat xss = foldr (++) [] xss

If you want to turn [[[a]]] into [a], you must use it twice:

Prelude> (concat . concat) [[[1,2],[3]],[[4]]]
[1,2,3,4]

More Related Contents:

  1. Haskell finding mean of cubes of odd members Any ideas? [closed]
  2. Histogram in Haskell [closed]
  3. What is Haskell’s Stream Fusion
  4. Using return vs. not using return in the list monad
  5. Cartesian product of infinite lists in Haskell
  6. Decrementing ranges in Haskell
  7. Zip with default value instead of dropping values?
  8. Replace individual list elements in Haskell?
  9. Using Haskell’s map function to calculate the sum of a list
  10. Need to partition a list into lists based on breaks in ascending order of elements (Haskell)
  11. Merging two lists in Haskell
  12. Haskell Monad – How does Monad on list work?
  13. Understanding a recursively defined list (fibs in terms of zipWith)
  14. Removing duplicates from a list in Haskell without elem
  15. Removing syntactic sugar: List comprehension in Haskell
  16. Counting unique elements in a list
  17. Unsequence Monad function within Haskell
  18. Grouping a list into lists of n elements in Haskell
  19. Concatenating two lists – difference between ‘+=’ and extend()
  20. How to check if all of the following items are in a list?
  21. Subsets in Prolog
  22. Java 8: sort list of objects by attribute without custom comparator
  23. Lazy lists in Prolog?
  24. How do I split or chunk a list into equal parts, with Dart?
  25. Python: create a pandas data frame from a list
  26. How to extend a Scala list to enable slicing not by explicit position but by given predicate/condition
  27. R: Print list to a text file
  28. Add or remove an entry from a List type attribute in a DynamoDB table item
  29. How to count items’ occurence in a List
  30. Prolog, find minimum in a list

Leave a Comment