Ask HN: Brevity in Haskell versus Common Lisp

I'm a CL developer, not a Haskell developer. But, in the interest of the Great Northern Wars [1], i need to ask HN:

+++ Is there any example out there on the web of a code made significantly briefer in Haskell (versus Clojure/Common Lisp/Arc/Racket/Scheme), while still being reasonably understandable? +++

I know this question cannot have a definite answer[2], so feel free to do not-so-serious answers as well.

[1] Great Northern Wars: See reference picture:

http://lemonodor.com/images/functional-programming-is-beautiful-s.jpg

Comic author: Conrad Barsky, MD.

[2] I found this nice, fun comparison of the "fake" quicksort that is typically used to show how brief can Haskell code be. The author proceeds to write the same algorithm under Common Lisp with good results:

http://blog.thezerobit.com/2012/09/01/beautiful-quicksort-in-common-lisp.html