What does the : infix operator do in Haskell?

by

: is the “prepend” operator:

x : xs

Returns a list which has x as first element, followed by all elements in xs. In other functional languages, this is usually called cons, because it “cons”tructs a list recursively by repeated application from an empty list:

1 : 2 : 3 : 4 : []

is the list [1, 2, 3, 4].

More Related Contents:

  1. How to run a for loop in Haskell
  2. Getting started with Haskell
  3. How is this fibonacci-function memoized?
  4. runST and function composition
  5. Explain this chunk of haskell code that outputs a stream of primes
  6. How to create a polyvariadic haskell function?
  7. What does (f .) . g mean in Haskell?
  8. foldl versus foldr behavior with infinite lists
  9. What is the purpose of Rank2Types?
  10. Finite comprehension of an infinite list
  11. What are paramorphisms?
  12. Are there pronounceable names for common Haskell operators? [closed]
  13. Generating Fibonacci numbers in Haskell?
  14. In Haskell, when do we use in with let?
  15. Pseudo-quicksort time complexity
  16. What are free monads?
  17. Zipper Comonads, Generically
  18. What part of Hindley-Milner do you not understand?
  19. Iterate over all pair combinations without repetition in Haskell
  20. foldl Implementation with Runtime Errors
  21. How does foldr work?
  22. Is there a monad that doesn’t have a corresponding monad transformer (except IO)?
  23. What does “pure” mean in “pure functional language”?
  24. How to make a type with restrictions
  25. Given a Haskell type signature, is it possible to generate the code automatically?
  26. Apostrophe in identifiers in Haskell
  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