On Quasi-Interpretations , Blind Abstractions , and Implicit Complexity †

@inproceedings{PATRICKBAILLOOnQ,
  title={On Quasi-Interpretations , Blind Abstractions , and Implicit Complexity †},
  author={T PATRICKBAILLO and O UGODALLAG and N JEAN-YVESMOYE}
}
  • P A T R I C K B A I L L O T, U G O D A L L A G O, J E A N-Y V E S M O Y E N
Quasi-interpretations are a technique to guarantee complexity bounds on first-order functional programs: with termination orderings they give in particular a sufficient condition for a program to be executable in polynomial time (Marion & Moyen 2000), called here the P-criterion. We study properties of the programs satisfying the P-criterion, in order to improve the understanding of its intensional expressive power. Given a program, its blind abstraction is the non-deterministic program… CONTINUE READING
6 Citations
13 References
Similar Papers

Similar Papers

Loading similar papers…