On Quasi-Interpretations, Blind Abstractions and Implicit Complexity - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

On Quasi-Interpretations, Blind Abstractions and Implicit Complexity

Patrick Baillot
Jean-Yves Moyen

Résumé

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, called here the P-criterion. We study properties of the programs satisfying the P-criterion, in order to better understand its intensional expressive power. Given a program on binary lists, its blind abstraction is the non-deterministic program obtained by replacing lists by their lengths (natural numbers). A program is blindly polynomial if its blind abstraction terminates in polynomial time. We show that all programs satisfying a variant of the P-criterion are in fact blindly polynomial. Then we give two extensions of the P-criterion: one by relaxing the termination ordering condition, and the other one (the bounded value property) giving a necessary and sufficient condition for a program to be polynomial time executable, with memoisation.
Fichier principal
Vignette du fichier
blind.pdf (255.18 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00023668 , version 1 (03-05-2006)

Identifiants

  • HAL Id : hal-00023668 , version 1

Citer

Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen. On Quasi-Interpretations, Blind Abstractions and Implicit Complexity. 8th International Workshop on Logic and Computational Complexity (LCC'06), August 10 - 11, 2006 (Satellite Workshop of FLOC-LICS 2006), 2006, Seattle, United States. ⟨hal-00023668⟩
82 Consultations
82 Téléchargements

Partager

Gmail Facebook X LinkedIn More