Interpretation of stream programs: characterizing type 2 polynomial time complexity

Abstract : We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such programs relying on second order interpretation that characterize two variants of type 2 polynomial complexity including the Basic Feasible Functions (BFF). These charac- terizations provide a new insight on the complexity of stream programs. Finally, we adapt these results to functions over the reals, a particular case of type 2 functions, and we provide a characterization of polynomial time complexity in Recursive Analysis.
Type de document :
Communication dans un congrès
21st International Symposium on Algorithms and Computation - ISAAC 2010, Dec 2010, Jeju Island, South Korea. Springer, 2010
Liste complète des métadonnées


https://hal.inria.fr/inria-00518381
Contributeur : Mathieu Hoyrup <>
Soumis le : vendredi 17 septembre 2010 - 10:50:48
Dernière modification le : jeudi 22 septembre 2016 - 14:31:58
Document(s) archivé(s) le : samedi 18 décembre 2010 - 02:59:04

Fichier

paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00518381, version 1

Collections

Citation

Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux. Interpretation of stream programs: characterizing type 2 polynomial time complexity. 21st International Symposium on Algorithms and Computation - ISAAC 2010, Dec 2010, Jeju Island, South Korea. Springer, 2010. <inria-00518381>

Partager

Métriques

Consultations de
la notice

356

Téléchargements du document

128