Skip to Main content Skip to Navigation
Journal articles

A Logical Approach To Deciding Semantic Subtyping

Nils Gesbert 1 Pierre Genevès 1 Nabil Layaïda 1 
1 TYREX - Types and Reasoning for the Web
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : We consider a type algebra equipped with recursive, product, function, intersection, union, and complement types together with type variables and implicit universal quantification over them. We consider the subtyping relation recently defined by Castagna and Xu over 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Tyrex Equipe Connect in order to contact the contributor
Submitted on : Monday, August 17, 2015 - 1:21:41 PM
Last modification on : Monday, July 25, 2022 - 3:44:12 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:53:36 AM


Files produced by the author(s)



Nils Gesbert, Pierre Genevès, Nabil Layaïda. A Logical Approach To Deciding Semantic Subtyping. ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2015, 38 (1), pp.31. ⟨10.1145/2812805⟩. ⟨hal-00848023v2⟩



Record views


Files downloads