Analysing the implicit complexity of programs

Jean-Yves Marion 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00099505
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 9:37:56 AM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM

Identifiers

  • HAL Id : inria-00099505, version 1

Collections

Citation

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

Share

Metrics

Record views

111