After enabling the corresponding language extension (see #9), the user should be able to define recursive terms like this: ```haskell enumFrom n = cons n (enumFrom (succ n)) ``` This definition is then desugared with the help of the Y combinator.
