Subtyping can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calculus considered: for instance, a call-by-value calculus and a call-by-name calculus will have different possible subtyping rules. In order to abstract ourselves away from this dependence, we consider a fairly large class of calculi. This allows us to find a subtyping relation which is both robust (it is sound for all calculi) and precise (it is complete with respect to the class of calculi)
MLsub extends traditional Hindley-Milner type inference with subtyping while preserving compact prin...
We develop a system of type assignment with intersection types, union types, indexed types, and univ...
Proof-functional logical connectives allow reasoning about the structure of logical proofs, in this ...
Abstract. The notion of subtyping has gained an important role both in theoretical and applicative d...
AbstractWe present a simple extension of typed λ-calculus where functions can be overloaded by putti...
Abstract. Key longstanding difficulties associated with subtyping can be avoided by using type unifi...
Part 3: Logic, Semantics, and Programming TheoryInternational audienceUsing Curry-Howard isomorphism...
We present a simple extension of typed -calculus where functions can be over-loaded by putting diere...
This artifact contains the mechanical formalization of the calculi associated with the paper Union T...
Subtyping relations for the π-calculus are usually defined in a syntactic way, by means of structura...
We present a simple extension of typed lambda-calculus where functions can be overloaded by putting ...
AbstractWe introduce new modal logical calculi that describe subtyping properties of Cartesian produ...
We introduce new modal logical calculi that describe subtyping properties of Cartesian product and d...
AbstractWhen sharing is studied in the λ-calculus, some sub-calculi often pop up, for instance λI or...
Subtyping relations for the π-calculus are usually defined in a syntactic way, by means of structura...
MLsub extends traditional Hindley-Milner type inference with subtyping while preserving compact prin...
We develop a system of type assignment with intersection types, union types, indexed types, and univ...
Proof-functional logical connectives allow reasoning about the structure of logical proofs, in this ...
Abstract. The notion of subtyping has gained an important role both in theoretical and applicative d...
AbstractWe present a simple extension of typed λ-calculus where functions can be overloaded by putti...
Abstract. Key longstanding difficulties associated with subtyping can be avoided by using type unifi...
Part 3: Logic, Semantics, and Programming TheoryInternational audienceUsing Curry-Howard isomorphism...
We present a simple extension of typed -calculus where functions can be over-loaded by putting diere...
This artifact contains the mechanical formalization of the calculi associated with the paper Union T...
Subtyping relations for the π-calculus are usually defined in a syntactic way, by means of structura...
We present a simple extension of typed lambda-calculus where functions can be overloaded by putting ...
AbstractWe introduce new modal logical calculi that describe subtyping properties of Cartesian produ...
We introduce new modal logical calculi that describe subtyping properties of Cartesian product and d...
AbstractWhen sharing is studied in the λ-calculus, some sub-calculi often pop up, for instance λI or...
Subtyping relations for the π-calculus are usually defined in a syntactic way, by means of structura...
MLsub extends traditional Hindley-Milner type inference with subtyping while preserving compact prin...
We develop a system of type assignment with intersection types, union types, indexed types, and univ...
Proof-functional logical connectives allow reasoning about the structure of logical proofs, in this ...