maude

Certainly there is similarity to Maude, in that both Maude and LastCalc are programmed through term rewriting.

The biggest algorithmic difference with Maude is that LastCalc has a backtracking parse engine.

For loops aren't, since languages like Prolog, Haskell, Erlang and Maude don't support them.

The Maude project [1] (and its documentation) may be of interest; they use term rewriting in a formal modeling and model-checking tool.

For a manual, it sure as hell doesn't tell me what Maude is.

Then it's not that different from what Maude is doing, for example.

We can also have Maude show that some terms are unreachable, for example that there is no input which rewrites to an Error symbol.

There's a good sized grocery store on Maude and Matilda.

Funny enough I think Maude also has a pattern matching system like Nova.

That's what languages like Pure and Maude do.

The only exception was Maude [1], which we had to use.

If you are currently employed at a pre-profit, post-Series-C startup, please be advised: Maude is approaching rapidly, and your severance package will not save you.

This is not a Maude Flanders "won't someone think of the children!" type issue.

Terman and his co-author Maude Merrill wrote in 1937, "There are, however, certain characteristics of age scores with which the reader should be familiar.

A subject has, strictly speaking, a number of mental ages; we are here concerned only with that which depends on the abilities tested by the new Stanford-Binet scales." Terman, Lewis & Merrill, Maude (1937).

Francis Maude, Minister for the Cabinet Office, to whom the Government Digital Service in-part report (the team responsible for gov.uk).

I was just writing a paper on formal tools, and made a passing reference to Maude.

Maude: Lord, you can imagine where it goes from here.