Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus

Abstract

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 λ-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.
Fichier principal
Vignette du fichier
978-3-662-44602-7_13_Chapter.pdf (373.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Licence

Attribution

Identifiers

Cite

Patrick Baillot, Erika de Benedetti, Simona Ronchi Della Rocca. Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.151-163, ⟨10.1007/978-3-662-44602-7_13⟩. ⟨hal-01015171v2⟩
429 View
548 Download

Altmetric

Share

Gmail Facebook X LinkedIn More