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

02/01/2019

∙

by   Lê Thành Dũng Nguyên, et al.

∙

0

∙

share

Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, 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.