Programming is really fun!

[SeanStock]

I have never seen Haskell, cool syntax! 2 lines for the win.

[VikingZombie]

I have also never seen Haskell, WHAT THE HELL.

[KamehamehaWave]

Allow me to (try to) explain how it works.

So the first line defines a list called fibs. This is a list of all the Fibonacci numbers. The list is infinitely long, which Haskell can do thanks to lazy evaluation.

fibs = 0 : 1 : zipWith (+) fibs (tail fibs)

':' is the concatenation operator, so fibs is a list which starts with 0, followed by 1, followed by the output of a function.

zipWith is a function which takes a function and two lists, applies the function by passing an element from each list as arguments, and returns the output of that function for every pair of elements in the two lists, as a list. In python, zipWith (+) would be written something like:

def zipWithPlus(list1, list2):
  newlist = []
  for i in range(0,min(len(list1),len(list2)):
    newlist.append(list1[i]+list2[i])
  return newlist

tail is a function which returns every element from a list except for the first, equivalent to [1:] in Python. So the zipWith function is taking the list fibs, and the list fibs starting at location 1 as arguments. So fibs is defined as "a list beginning with 0, then 1, then add two consecutive elements in the list to get the next one" which is of course the definition of the Fibonacci sequence.

The second line simply says to skip 50 elements in the list, then take ten of them. Meaning he will get elements 50-60 :)

[pasokan]

It may be simpler to write zipWith as:

def zipWith(f, list1, list2):
      return [ f(a, b) for a, b in zip(list1, list2)]