A simple proof of a generalized Church-Rosser theorem
Our rough guess is there are 3,750 words in this book.
At a pace averaging 250 words per minute, this book will take 0 hours and 15 minutes to read. With a half hour per day, this will take 1 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Naval Postgraduate School (U.S.) - Contributor
Publication
1984 - Naval Postgraduate School, Monterey, California, California
Language
English
Word Count
3,750 words, Guess
Page Count
15 pages
Identifiers
- Internet Archivesimpleproofofgen00macl
- OCLC Control Number460637431
- Open LibraryOL25498532M
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.
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!