> The way to do it would be to show concrete examples of problems which are difficult to solve in say Java, and then show how that is a non-problem in Haskell e

> The way to do it would be to show concrete examples of problems which are difficult to solve in say Java, and then show how that is a non-problem in Haskell etc. I've been impressed by the Mirage blog posts [1]. If I were going to pick a single example with the biggest size/complexity win over an imperative language, the ASN.1 Combinators [2] post would be the example. [1] http://openmirage.org/blog/announcing-mirage-20-release http://openmirage.org/blog/announcing-mirage-20-release [2] http://openmirage.org/blog/introducing-asn1 http://openmirage.org/blog/introducing-asn1 The general problem with the good examples is that they're deeply tied into a different school of thought. If you don't have a general idea of what's going on, the example is completely incomprehensible. The only functional language advocacy site I know of that's really attempting to bridge this gap is "F# for fun and profit" [3]. [3] http://fsharpforfunandprofit.com/why-use-fsharp/ http://fsharpforfunandprofit.com/why-use-fsharp/