## Efficient First Order Functional Program Interpreter With Time Bound Certifications (2000)

Citations: | 26 - 10 self |

### BibTeX

@MISC{Marion00efficientfirst,

author = {J.-Y. Marion and J.-Y. Moyen},

title = {Efficient First Order Functional Program Interpreter With Time Bound Certifications},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

We demonstrate that the class of rst 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 (i) on the simplicity of the conditions on programs to certify their complexity, (ii) on the fact that an important class of natural programs is captured, (iii) and on potential applications on program optimizations. 1 Introduction This paper is part of a general investigation on the implicit complexity of a specication. To illustrate what we mean, we write below the recursive rules that computes the longest common subsequences of two words. More precisely, given two strings u = u1 um and v = v1 vn of f0; 1g , a common subsequence of length k is dened by two sequences of indices i 1 < < i k and j1 < < jk satisfying u i q = v j q . lcs(; y) ! 0 lcs(x; ) ! 0 lcs(i(x); i(y)) ! lcs(x; y) + 1 lcs(i(...