Rewrite orderings for higher-order terms in -long -normal form and the recursive path ordering

Author： Jouannaud J.-P.   Rubio A.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.208, Iss.1, 1998-11, pp. : 33-58

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

The recursive path and polynomial ordering for first-order and higher-order terms

By Bofill Miquel   Borralleras Cristina   Rodrguez-Carbonell Enric   Rubio Albert  

Journal of Logic and Computation, Vol. 23, Iss. 1, 2013-02 ,pp. : 263-305

Oxford University Press

Access to resources Recommend Favorite

Higher-order rewrite systems and their confluence

By Mayr R.   Nipkow T.  

Theoretical Computer Science, Vol. 192, Iss. 1, 1998-02 ,pp. : 3-29

Elsevier

Access to resources Recommend Favorite

Recursive equations in higher-order process calculi

By Ying  

Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. : 839-852

Elsevier

Access to resources Recommend Favorite

The first-order theory of lexicographic path orderings is undecidable

By Comon H.   Treinen R.  

Theoretical Computer Science, Vol. 176, Iss. 1, 1997-04 ,pp. : 67-87

Elsevier

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