Interaction nets and term-rewriting systems

Author： Fernandez M.   Mackie I.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

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

Semantics and strong sequentiality of priority term rewriting systems

By Sakai M.   Toyama Y.  

Theoretical Computer Science, Vol. 208, Iss. 1, 1998-11 ,pp. : 87-110

Elsevier

Access to resources Recommend Favorite

Modular proofs for completeness of hierarchical term rewriting systems

By Rao M.R.K.K.  

Theoretical Computer Science, Vol. 151, Iss. 2, 1995-11 ,pp. : 487-512

Elsevier

Access to resources Recommend Favorite

Modular termination of r-consistent and left-linear term rewriting systems

By Schmidt-Schausz M.   Marchiori M.   Panitz S.E.  

Theoretical Computer Science, Vol. 149, Iss. 2, 1995-10 ,pp. : 361-374

Elsevier

Access to resources Recommend Favorite