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

Author： Bofill Miquel   Borralleras Cristina   Rodrguez-Carbonell Enric   Rubio Albert  

Publisher： Oxford University Press

ISSN： 1465-363X

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

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

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

By Jouannaud J.-P.   Rubio A.  

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

Elsevier

Access to resources Recommend Favorite

The p-recursive piecewise polynomial sigmoid generators and first-order algorithms for multilayer tanh-like neurons

By Sunat Khamron   Lursinsap Chidchanok   Chu Chee-Hung  

Neural Computing & Applications, Vol. 16, Iss. 1, 2007-01 ,pp. : 33-47

Springer Publishing Company

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

Asynchronous process calculi: the first- and higher-order paradigms

By Sangiorgi D.  

Theoretical Computer Science, Vol. 253, Iss. 2, 2001-02 ,pp. : 311-350

Elsevier

Access to resources Recommend Favorite