We present a type inference system for a language with object-oriented features such as polymorphic record access and subtyping. We separate the notion of matching and subtyping in order to avoid di culties caused by recursive type constraints. We will use two kinds of type constraints | record (variant) constraints and subtyping constraints. Then, we discuss simpli cation of such mixed type co...

One of the most frequent operations in object-oriented programs is the instanceof test, also called the subtyping test or the type inclusion test. This test determines if a given object is an instance of some type. Surprisingly, despite a lot of research on distributed object-oriented languages and systems, almost no work has been devoted to the implementation of this test in a distributed envi...

HIV-1 pol gene sequencing is now used routinely in France to identify mutations associated with resistance to reverse transcriptase (RT) or protease (PR) inhibitors. These sequences may also provide other information, such as the HIV-1 subtype. HIV-1 subtyping was compared using the RT and PR gene sequences to heteroduplex mobility assay (HMA) of the envelope gene. The RT and PR genes of 51 sam...

The paper briefly introduces the language S-Net and discusses in detail its concept of type and subtyping. Novel subtyping features are described and analysied: tag-controlled record subtyping and flow inheritance. A simple semantic formalism is proposed and the semantics of S-Net closure defined. We prove that type inference for S-Net is computationally efficient provided that the resulting ty...

The standard subtyping relation used in dyadic session type theories may compromise the liveness of multi-party sessions. In this paper we define a fair subtyping relation for multi-party session types that preserves liveness, we relate it with the standard subtyping relation, and we give algorithms for deciding it. As a side effect, we provide an original and remarkably simple coinductive char...

This paper introduces a coalgebraic foundation for coinductive types, interpreted as sets of values and extended with set theoretic union. We give a sound and complete characterization of semantic subtyping in terms of inclusion of maximal traces. Further, we provide a technique for reducing subtyping to inclusion between sets of finite traces, based on approximation. We obtain inclusion of tre...

I start with an explanation of the notion of ‘subtyping’ to make clear what it means to subtype a type r against a type s. It will be pointed out, how types are represented in the subtyping algorithm. Then I will explain the main idea of the subtyping algorithm and make clear what subconcepts are needed. In detail, those are the concepts of checking for -inclusion, leading names and partial der...

The combination of higher-order subtyping with intersection types yields a typed model of object-oriented programming with multiple inheritance 11]. The target calculus, F ! ^ , a natural generalization of Girard's system F ! with intersection types and bounded polymorphism, is of independent interest, and is our subject of study. Our main contribution is the proof that subtyping in F ! ^ is de...

A fundamental assumption in the use and interpretation of microbial subtyping results for public health investigations is that isolates that appear to be related based on molecular subtyping data are expected to share commonalities with respect to their origin, history, and distribution. Critically, there is currently no approach for systematically assessing the underlying epidemiology of subty...