Recursion Excursion | To Overcome

September 24, 2015 Recursive definitions are a lot of fun. The typical example of a recursive definition is the natural numbers: A natural number is either 0 or the successor of a natural number. Expressed in Haskell, this is: Zero is Zero, as you'd expect. One is Succ Zero, two is Succ (Succ Zero), etc. The natural numbers can be recursively defined like this. Extension One: Lists are extremely s