On lexicographic termination ordering with space bound certifications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

On lexicographic termination ordering with space bound certifications

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.
Not file

Dates and versions

inria-00100523 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100523 , version 1

Cite

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⟩
59 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More