What is recursion in Haskell?

Can you explain what recursion is in Haskell?

Recursion in Haskell is a technique where a function calls itself to solve smaller instances of the same problem.

Can you give me an example of a recursive function in Haskell?

Sure! A classic example is the factorial function:

factorial 0 = 1
factorial n = n * factorial (n - 1)

How does Haskell handle recursion differently than other languages?

Haskell uses lazy evaluation, which means it can handle infinite lists and recursive calls more efficiently than strict languages.

What are some common pitfalls when using recursion in Haskell?

Common pitfalls include stack overflow from deep recursion and not defining a proper base case, which can lead to infinite loops.