title: Comparing List Elements in Haskell
body: <p>I'm just learning Haskell and am kind of stuck.
  I'd like to compare list elements and measure the difference between them and return the highest one. 
  Unfortunatly, I do not know how to approach that problem.
  For usual, I'd just iterate the list and compare the neighbours but that does not seem to be the way to go in Haskell.
  I already tried using <code>map</code> but as I said I do not really know how you can solve that problem.
  I'd be thankful for every kind of advice!</p>
  
  <p>Best wishes</p>
  
  <p>Edit: My idea is to first zip all pairs like this <code>pairs a = zip a (tail a)</code>. Then I'd like to get all differences (maybe with <code>map</code>?) and then just chose the highest one. I just can't handle the Haskell syntax.</p>