On the Modularity of Normal Forms in Rewriting

By Marchiori M.  

Journal of Symbolic Computation, Vol. 22, Iss. 2, 1996-02 ,pp. : 143-154

Academic Press

Access to resources Recommend Favorite

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

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

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

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

By Mano K.   Ogawa M.  

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

Elsevier

Access to resources Recommend Favorite