Parametric Polymorphism and Semantic Subtyping: the Logical Connection - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2011

Parametric Polymorphism and Semantic Subtyping: the Logical Connection

Pierre Genevès
Nabil Layaïda

Abstract

We consider a type algebra equipped with recursive, product, function, intersection, union, and complement types together with type variables and universal quantification over them. We consider the subtyping relation recently defined by Castagna and Xu between such type expressions and show how this relation can be decided in EXPTIME, answering an open question. The novelty, originality and strength of our solution reside in introducing a logical modeling for the semantic subtyping framework. We model semantic subtyping in a tree logic and use a satisfiability-testing algorithm in order to decide subtyping. We report on practical experiments made with a full implementation of the system. This provides a powerful polymorphic type system aiming at maintaining full static type-safety of functional programs that manipulate trees, even with higher-order functions, which is particularly useful in the context of XML.
Fichier principal
Vignette du fichier
icfp.pdf (481.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00585686 , version 1 (13-04-2011)
inria-00585686 , version 2 (06-09-2011)

Identifiers

  • HAL Id : inria-00585686 , version 1

Cite

Nils Gesbert, Pierre Genevès, Nabil Layaïda. Parametric Polymorphism and Semantic Subtyping: the Logical Connection. 2011. ⟨inria-00585686v1⟩
357 View
424 Download

Share

Gmail Facebook X LinkedIn More