Finite semantics of polymorphism, complexity and the power of type fixpoints

Abstract : Many applications of denotational semantics, such as higher-order model checking or the complexity of normaliza-tion, rely on finite semantics for monomorphic type systems. We present two constructions of finite semantics for second-order Multiplicative-Additive Linear Logic (MALL2) and study their properties. We apply this to understand the gap in expressive power between MALL2 and its extension with type fixpoints, and to obtain an implicit characterization of regular languages in Elementary Linear Logic. Furthermore, some semantic results established here lay the groundwork for a sequel paper proposing a new approach to sub-polynomial implicit complexity.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées

Littérature citée [53 références]  Voir  Masquer  Télécharger
Contributeur : Lê Thành Dũng Nguyễn <>
Soumis le : samedi 12 janvier 2019 - 12:05:52
Dernière modification le : mardi 14 mai 2019 - 21:52:02
Document(s) archivé(s) le : samedi 13 avril 2019 - 12:39:40


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01979009, version 1



Lê Thành Dũng Nguyễn, Thomas Seiller, Paolo Pistone, Lorenzo Tortora de Falco. Finite semantics of polymorphism, complexity and the power of type fixpoints. 2019. ⟨hal-01979009⟩



Consultations de la notice


Téléchargements de fichiers