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 ...

Aug 17, 2015 · We model semantic subtyping in a tree logic and use a satisfiability-testing algorithm in order to decide subtyping. We report on practical ...

We consider a type algebra equipped with recursive, product, function, intersection, union, and complement types, together with type variables.

Jul 25, 2013 · In the present paper, we show in some sense how to push the semantic approach further, all the way into the decision algorithm — we could say we ...

A Logical Approach to Deciding Semantic Subtyping · N. Gesbert, P. Genevès, Nabil Layaïda · Published in ACM Transactions on… 10 July 2013 · Computer Science, ...

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 ...

A Logical Approach to Deciding Semantic Subtyping (English) · More details on this result · Table of contents · Table of contents – Volume 38, Issue 1 · Similar ...

A Logical Approach To Deciding Semantic Subtyping. Author. Genevès Pierre · Gesbert Nils · Layaïda Nabil. Publication venue: 'Association for Computing ...

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 ...

This article extends and improves that previous publication in the following ways: ... A Logical Approach To Deciding Semantic Subtyping. Article. Oct 2015.