Bounded existential types are a powerful language feature ling partial data abstraction and information hiding. However, existentials do not mingle well with subtyping as found in ...
This paper introduces a typed λ-calculus called λPower , a predicative reformulation of part of Cardelli’s power type system. Power types integrate subtyping into the typing t...
Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics ...
The impact of types on the algebraic theory of the π-calculus is studied. The type system has capability types. They allow one to distinguish between the ability to read from a c...
Object type constructors have been introduced as an approach to adding container object types to a language with type inference. Useful subtyping for object type constructors requ...