On lexicographic termination ordering with space bound certifications

Guillaume Bonfante 1 Jean-Yves Marion 1 Jean-Yves Moyen 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We propose a method to analyse the program space complexity, based on termination orderings. This method can be implemented to certify the runspace of programs. We demonstrate that the class of functions computed by first order functional programs over free algebras which terminate by Lexicographic Path Ordering and admit a polynomial quasi-interpretation, is exactly the class of functions computable in polynomial space.
Type de document :
Communication dans un congrès
D. Bjorner, M. Broy, A. Zamulin. International Andrei Ershov Memorial Conference - PSI'01, 2001, Novosibirsk, Russia, Springer, 2244, pp.482-493, 2001, Lecture notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/inria-00100523
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:46:28
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00100523, version 1

Collections

Citation

Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. On lexicographic termination ordering with space bound certifications. D. Bjorner, M. Broy, A. Zamulin. International Andrei Ershov Memorial Conference - PSI'01, 2001, Novosibirsk, Russia, Springer, 2244, pp.482-493, 2001, Lecture notes in Computer Science. 〈inria-00100523〉

Partager

Métriques

Consultations de la notice

96