Referenced Items are not available for this document.
A general theory of using a congruence closure based simplifier (CCNS) proposed by P. Chew (1980) for computing normal forms is developed, and several applications are presented. An independent set of postulates is given, and it is proved that CCNS can be used for any system that satisfies them. It is then shown that CCNS can be used for consistent convergent systems and for various kinds of priority rewrite systems. A simple translation scheme for converting priority systems into effectively nonoverlapping convergent systems is presented
Published in:
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Date of Conference: 1-4 Oct 1991
- Page(s):
- 348 - 357
- Meeting Date :
- 01 Oct 1991-04 Oct 1991
- Print ISBN:
- 0-8186-2445-0
- INSPEC Accession Number:
- 4243845
- Conference Location :
- San Juan
- Digital Object Identifier :
- 10.1109/SFCS.1991.185390
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
