… categorical or logical understanding of subtyping (although a … In this paper, we propose
a logical theory of subtyping, as a … In this extended abstract, we give only a few lemmas and …

… To obtain a uniform representation of abstraction, we need to unify the typing and subtyping
relation in the first place. Moreover, calculi with PTS-style unified syntax usually allow …

… Introduced in this paper logics of subtyping do not describe subtyping properties of any
particular type system. Instead, they describe common properties of rather general class of type …

… We shall show how to extend the basic subtyping relations, such as the one among records,
to all type constructors in certain languages. This program can be carried out in many type …

… The main purpose of this article is to use a logical satisfiability solver for deciding subtyping.
To decide whether τ is a subtype of type τ , we first construct equivalent logical formulas ϕτ …

… subtyping, we have used the ideas presented in this article to show coherence of subtyping
in … simply typed lambda calculus with subtyping [27, Chapter 10] extended with recursion, the …

… The need for subtyping in type-systems with dependem types has been … a subtyping
extension ofthe system AP, which is an abstract version ofthe type system ofthe Edinburgh Logical …

… in which an inductive type σ is viewed as a subtype of another … supports record subtyping
and constructor subtyping. In the … Finally, in the third part of the paper, we extend our calculus …

… section, we apply our refined subtyping … and extended; we then use the equational …
First, we want a logic in which proofs about programs may be phrased — a many-sorted, …

… Abstract. We give syntax and a PER-model semantics for a typed A-calculus with subtypes
and … , but we have a subtyping rule that says that a singleton type is a subtype of its type tag: …