Highlight advantages over other functional programming languages about pure-lang

[agraef]

Well, I already discuss this, to some extent, on the homepage (check the Examples section), in the Pure Quick Reference (specifically, check Section 8.10) and on the Rewriting wiki page, and some more symbolic evaluation examples are listed on the Examples wiki page, so I'm not sure what more I could do.

In particular, the units.pure example is one of the less esoteric examples where term rewriting is actually being used, and most programmers can probably relate to this.

The average user with the mundane kind of programming tasks that you mention will probably benefit more from Pure as a dynamically typed, JIT-compiled alternative to the likes of ML and Haskell, which makes it easier to get into functional programming if they're using Python or Ruby right now but may be curious about FP.

Maybe it would be a good idea to take this discussion to the mailing list where other users may chime in. I'm not sure what to do about this ticket, so I'm closing it for now. But feel free to reopen it if you have examples which should be added to the docs and/or the sources.

[richsmith92]

Thanks for the answer! I didn't notice you have a mailing list, I'll probably use it next time.

Regarding rewriting, pattern matching in Haskell feels very second-class, so next time I encounter its limitations, I'll try to implement the same logic in Pure. This should be a good show case for me at least.

[agraef]

Regarding rewriting, pattern matching in Haskell feels very second-class

Exactly. In particular, Haskell hasn't anything like Pure's reduce or Mathematica's ReplaceAll.