From normal functors to logarithmic space queries - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

From normal functors to logarithmic space queries

Résumé

We introduce a new approach to implicit complexity in linear logic, inspired by functional database query languages and using recent developments in effective denotational semantics of polymorphism. We give the first sub-polynomial upper bound in a type system with impredicative polymorphism; adding restrictions on quantifiers yields a characterization of logarithmic space, for which extensional completeness is established via descriptive complexity.
Fichier principal
Vignette du fichier
ell2lul.pdf (659.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02024152 , version 1 (01-03-2019)
hal-02024152 , version 2 (30-04-2019)
hal-02024152 , version 3 (13-02-2023)

Licence

Paternité

Identifiants

Citer

Lê Thành Dũng Nguyễn, Pierre Pradic. From normal functors to logarithmic space queries. 46th International Colloquium on Automata, Languages and Programming (ICALP 2019), Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.123⟩. ⟨hal-02024152v2⟩
228 Consultations
254 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More