A simple proof of a generalized Church-Rosser theorem
By: [by] B.J. MacLennan
Contributors: Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1984
Place of publication: Monterey, California
Language: eng
Number of pages: 15
Subjects: Calculus; Lambda calculus; Symbolic and mathematical Logic; Mathematical analysis
Description: Abstract calculi (tree transformation systems, term rewriting systems) express computational processes by transformation rules operating on abstract structures (trees).   They have applications to functional programming, logic programming, equational programming, productions systems and language processors.  We present proof of the Church-Rosser Theorem for a wide, useful class of abstract calculi.  This theorem implies that terminating reductions always yield a unique reduced form in these calculi, which has the practical result that transformation rules can be safely applied in any order, or even in parallel.  Although this result has previously been established for certain classes of abstract calculi, our proof is much simpler than previous proofs because it is an adaption of Rosser's new (1982) proof of the Church-Rosser Theorem for the lambda calculus.
Notes: Title from cover.

"Prepared for: Chief of Naval Research"--Cover.

"June 1984"--Cover.

"NPS52-84-007"--Cover.

Author(s) key words: Church-Rosser, theorem, abstract calculus, tree transformation, term rewriting, functional programming, logic programming, equational programming, production systems, tree, nondeterministic algorithm, normal form, lambda calculus.

Includes bibliographical references (p. 13-14).

"Approved for public release; distribution unlimited"--Cover.

Technical report; 1984.

aq/aq cc:9116 02/25/98

kmc/kmc 10/28/09.