From normal functors to logarithmic space queries - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

From normal functors to logarithmic space queries

Abstract

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
spinoff.pdf (664.28 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission

Dates and versions

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

Licence

Attribution

Identifiers

Cite

Lê Thành Dũng Nguyễn, Cécilia 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-02024152v3⟩
217 View
252 Download

Altmetric

Share

Gmail Facebook X LinkedIn More