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.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-02024152
Contributeur : Lê Thành Dũng Nguyễn <>
Soumis le : vendredi 1 mars 2019 - 17:03:47
Dernière modification le : mercredi 6 mars 2019 - 01:26:13

Fichier

ell2lul.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-02024152, version 1

Collections

Citation

Lê Thành Dũng Nguyễn, Pierre Pradic. From normal functors to logarithmic space queries. 2019. 〈hal-02024152〉

Partager

Métriques

Consultations de la notice

36

Téléchargements de fichiers

25