Efficient first order functional program interpreter with time bound certifications - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2000

Efficient first order functional program interpreter with time bound certifications

Résumé

We demonstrate that the class of functions computed by first order functional programs over lists which terminate by multiset path ordering and admit a polynomial quasi-interpretation, is exactly the class of function computable in polynomial time. The interest of this result lies on (i) the simplicity of the conditions on programs to certify their complexity, (ii) the fact that an important class of natural programs is captured, (iii) potential applications for program optimization.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : inria-00099178 , version 1

Citer

Jean-Yves Marion, Jean-Yves Moyen. Efficient first order functional program interpreter with time bound certifications. International Conference on Logic Programming & Automated Reasoning - LPAR'2000, Nov 2000, Reunion Island, France, pp.25-42. ⟨inria-00099178⟩
58 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More