Finite semantics of polymorphism, complexity and the power of type fixpoints - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2019

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.
Fichier principal
Vignette du fichier
lics.pdf (443.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01979009 , version 1 (12-01-2019)

Identifiers

  • HAL Id : hal-01979009 , version 1

Cite

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⟩
287 View
253 Download

Share

Gmail Facebook X LinkedIn More