Combining Linear Logic and Size Types for Implicit Complexity - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Combining Linear Logic and Size Types for Implicit Complexity

Résumé

Several type systems have been proposed to statically control the time complexity of lambdacalculus programs and characterize complexity classes such as FPTIME or FEXPTIME. A first line of research stems from linear logic and restricted versions of its !-modality controlling duplication. A second approach relies on the idea of tracking the size increase between input and output, and together with a restricted recursion scheme, to deduce time complexity bounds. However both approaches suffer from limitations : either a limited intensional expressivity, or linearity restrictions. In the present work we incorporate both approaches into a common type system, in order to overcome their respective constraints. Our system is based on elementary linear logic combined with linear size types, called sEAL, and leads to characterizations of the complexity classes FPTIME and 2k-FEXPTIME, for k >= 0.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-01948196 , version 1

Citer

Patrick Baillot, Alexis Ghyselen. Combining Linear Logic and Size Types for Implicit Complexity. Conference on Computer Science Logic, CSL 2018, Sep 2018, Birmingham, France. pp.9:1--9:21. ⟨hal-01948196⟩
32 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More