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.
Type de document :
Article dans une revue
Information and Computation, Elsevier, 2003, 183, pp.2-18
Liste complète des métadonnées

https://hal.inria.fr/inria-00099505
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 09:37:56
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

76