Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus

Résumé

In this paper an implicit characterization of the complexity classes k-EXP and k-FEXP, for k>=0, is given, by a type assignment system for a stratified lambda-calculus, where types for programs are witnesses of the corresponding complexity class. Types are formulae of Elementary Linear Logic (ELL), and the hierarchy of complexity classes k-EXP is characterized by a hierarchy of types. (This on-line version contains an appendix of 14 pages with full proofs of the statements)
Fichier principal
Vignette du fichier
main.pdf (324.71 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01015171 , version 1 (25-06-2014)
hal-01015171 , version 2 (24-11-2016)

Identifiants

  • HAL Id : hal-01015171 , version 1

Citer

Patrick Baillot, Erika de Benedetti, Simona Ronchi Della Rocca. Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus. IFIP conference on Theoretical Computer Science, Aug 2014, Rome, Italy. 15 p. ⟨hal-01015171v1⟩
441 Consultations
580 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More