From normal functors to logarithmic space queries

Lê Thành Dũng Nguyễn (1) , Pierre Pradic (2)

1 LIPN - Laboratoire d'Informatique de Paris-Nord
2 LIP - Laboratoire de l'Informatique du Parallélisme

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.

Mots clés: semantic evaluation; coherence spaces; elementary linear logic

Domaines: Logique en informatique [cs.LO]; Complexité [cs.CC]; Langage de programmation [cs.PL]

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