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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00100523
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 2:46:28 PM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM

Identifiers

  • HAL Id : inria-00100523, version 1

Collections

Citation

Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. On lexicographic termination ordering with space bound certifications. International Andrei Ershov Memorial Conference - PSI'01, 2001, Novosibirsk, Russia, pp.482-493. ⟨inria-00100523⟩

Share

Metrics

Record views

104