Analysing the implicit complexity of programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information and Computation Year : 2003

Analysing the implicit complexity of programs


We study termination proofs in order to (i) determine computational complexity of programs and (ii) generate efficient programs from the complexity analysis. For this, we construct a termination ordering, called light multiset path ordering (LMPO), which is a restriction of the multiset path ordering. We establish that the class of first order functional programs on lists which is terminating by LMPO characterises exactly the functions computable in polynomial time.
Not file

Dates and versions

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


  • HAL Id : inria-00099505 , version 1


Jean-Yves Marion. Analysing the implicit complexity of programs. Information and Computation, 2003, 183, pp.2-18. ⟨inria-00099505⟩
58 View
0 Download


Gmail Facebook Twitter LinkedIn More