pure-lang

There is a section in GitHub, which is where most of the documentation seems to be anyway. This FAQ is linked directly from the website. https://github.com/agraef/pure-lang/wiki/FAQ#why-pure

I think rewrite is related to program transformation [1]? Most stuff that I've seen looks pretty academic, obscure, not very well maintained, etc ... Pure [2] is the only practical language I've stumbled upon that appears to be general purpose _and_ based on term rewrite. I wonder if XSLT could fall under this umbrella? It rewrites trees into other trees ... not sure if that's enough to be considered a term rewrite system. If yes, then maybe CDuce is also an interesting thing to check. The author of Ragel also has a program transformation system [4], but I'm not sure what state it is at, he seems to have been working on it for a long while but it doesn't seem to be something nearly as popular as Ragel. Edit: I think specter [5] and meander [6] also could be, perhaps tangentially, related to rewriting. Meander expressly mentions rewrite as

It makes me so happy to see more rewrite based languages. Another one that is extremely cool that I almost never see brought up is [pure][1][2]. [1]: https://agraef.github.io/pure-lang/ [2]: https://github.com/agraef/pure-lang/wiki/PureIntro

This is pretty neat! https://github.com/agraef/pure-lang/wiki/Rewriting#construct...: > As a bonus, you also get "constructors with equations" for free. E.g., suppose that we want lists to automagically stay sorted and eliminate duplicates. In Pure we can do this by simply adding the following equations for the : constructor: > x:y:xs = y:x:xs if x>y; x:y:xs = x:xs if x==y; > [13,7,9,7,1]+[1,9,7,5]; [1,5,7,9,13] (The point about this global override is addressed later. The rewriting can be lexically scoped.)