Modular Termination Proofs for Rewriting Using Dependency Pairs

By Giesl J.   Arts T.   Ohlebusch E.  

Journal of Symbolic Computation, Vol. 34, Iss. 1, 2002-07 ,pp. : 21-58

Academic Press

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

Modular aspects of term graph rewriting

By Krishna Rao M.R.K.  

Theoretical Computer Science, Vol. 208, Iss. 1, 1998-11 ,pp. : 59-86

Elsevier

Access to resources Recommend Favorite

Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths

By Weiermann A.  

Theoretical Computer Science, Vol. 139, Iss. 1, 1995-03 ,pp. : 355-362

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