Commentary by Chris Pressey

This work is distributed under a CC-BY-ND-4.0 license, with the following explicit exception: the ratings may be freely used for any purpose with no limitations.

Term Rewriting

Advanced Topics in Term Rewriting

• rating: 2

.

Reflection in Rewriting Logic

• rating: 0

Page 10 gives the rules of inference for rewriting logic.

The book seems otherwise not-very-interesting. It might become more interesting if I became more interested in reflection in this logic, but here it seems to be tied up with "strategies", which feels a little expedient and is thus a little off-putting.

Combinatory Reduction Systems

• rating: 2

Ahh, it is a poorly-written paper, but, it is also covering a very interesting subject matter, and, it does give a formal definition of CRS'es. CRS'es are term rewriting systems that support name binding, like the lambda calculus does.

Matching Power

• rating: 1

A simple (mostly) exposition of the rho-calculus, a lambda calculus-like calculus for term rewriting systems, or for lambda calculus with matching.

The Rho Cube

• rating: TODO

.

A Constructive Semantics for Rewriting Logic

• rating: 2

PhD thesis. Has a few good things in it.

Rewriting Logic as a Logical and Semantic Framework

• rating: 0

.