Unique normal form property of compatible term rewriting systems: a new proof of Chew's theorem

Author： Mano K.   Ogawa M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.258, Iss.1, 2001-05, pp. : 169-208

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Proof theory of higher-order equations: conservativity, normal forms and term rewriting

By Meinke K.  

Journal of Computer and System Sciences, Vol. 67, Iss. 1, 2003-08 ,pp. : 127-173

Elsevier

Access to resources Recommend Favorite

Infinite normal forms for non-linear term rewriting systems

By Inverardi P.   Nesi M.  

Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. : 285-303

Elsevier

Access to resources Recommend Favorite

Interaction nets and term-rewriting systems

By Fernandez M.   Mackie I.  

Theoretical Computer Science, Vol. 190, Iss. 1, 1998-01 ,pp. : 3-39

Elsevier

Access to resources Recommend Favorite

On interreduction of semi-complete term rewriting systems

By Gramlich  

Theoretical Computer Science, Vol. 258, Iss. 1, 2001-05 ,pp. : 435-451

Elsevier

Access to resources Recommend Favorite

Reachability Analysis over Term Rewriting Systems

By Feuillade Guillaume   Genet Thomas   Viet Triem Tong Valérie  

Journal of Automated Reasoning, Vol. 33, Iss. 3-4, 2004-10 ,pp. : 341-383

Springer Publishing Company

Access to resources Recommend Favorite