Characterizing polynomial and exponential complexity classes in elementary lambda-calculus. - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information and Computation Année : 2018

Characterizing polynomial and exponential complexity classes in elementary lambda-calculus.

Résumé

In this paper an implicit characterization of the complexity classes kEXP and kFEXP, 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 kEXP is characterized by a hierarchy of types.
Fichier non déposé

Dates et versions

hal-01948275 , version 1 (07-12-2018)

Identifiants

  • HAL Id : hal-01948275 , version 1

Citer

Patrick Baillot, Erika de Benedetti, Simona Ronchi Della Rocca. Characterizing polynomial and exponential complexity classes in elementary lambda-calculus.. Information and Computation, 2018, 248, pp.55-77. ⟨hal-01948275⟩
25 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More