Skip to Main content Skip to Navigation
Conference papers

Efficient first order functional program interpreter with time bound certifications

Jean-Yves Marion 1 Jean-Yves Moyen 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Mots-clés : analyse complexité program transformation runtime analysis transformation programmes
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/inria-00099178
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:51:33 AM
Last modification on : Friday, February 4, 2022 - 3:34:26 AM

Identifiers

  • HAL Id : inria-00099178, version 1

Collections

INRIA | CNRS | LORIA | UNIV-LORRAINE | INRIA2

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

51

 

Contact                    Legal Notice                    Personal Data