HORPO with computability closure: A reconstruction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4790 LNAI, Issue , 2007, Pages 138-150

  Blanqui, Frédéric ^a   Jouannaud, Jean Pierre ^b   Rubio, Albert ^c  

^a LORIA   (France)

^b ECOLE POLYTECHNIQUE   (France)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; PROBLEM SOLVING;

COMPUTABILITY CLOSURE; POSITIVE INDUCTIVE TYPES;

COMPUTABILITY AND DECIDABILITY;

EID: 38149005474     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75560-9_12     Document Type: Conference Paper

References (5)

1. Blanqui, F. (HO)RPO revisited. Research Report 5972, INRIA (2006)
2. Blanqui, F., Jouannaud, J.-P., Rubio, A.: Higher order termination: from Kruskal to computability. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, Springer, Heidelberg (2006)
3. Jouannaud, J.-P., Rubio, A.: The higher-order recursive path ordering. In: 14th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos (1999)
4. Jouannaud, J.-P., Rubio, A.: Polymorphic higher-order recursive path orderings. Journal of the ACM 54(1), 1-48 (2007)
5. Walukiewicz-Chrzaszcz, D.: Termination of rewriting in the Calculus of Constructions. In: Proceedings of the Workshop on Logical Frameworks and Meta-languages (2000)