N-Queens problem in Haskell

Here is a classic problem. The N-Queens problem consists in placing N queens on a board without interfering. Two queens must be on different rows, columns and diagonals.

So here is my own version...

• the source code in Literate Haskell: nqueens.lhs
• the document rendered in Markdown: nqueens.md