We present a sound type-based'usage analysis' for a realistic lazy functional language.
Accurate information on the usage of program subexpressions in a lazy functional language …

The need for subtyping in type-systems with dependent types has been realized for some
years. But it is hard to prove that systems combining the two features have fundamental …

The goal of feature-oriented programming (FOP) is to modularize software systems in terms
of features. A feature refines the content of a base program. Both base programs and …

The need for subtyping in type systems with dependent types has been realized for some
years. But it is hard to prove that systems combining the two features have fundamental …

The calculus of higher order subtyping, known as F ω≤, a higher-order polymorphic λ-
calculus with subtyping, is expressive enough to serve as core calculus for typed object …

A relation between recursive object types, called matching, has been proposed as a
generalization of subtyping. Unlike subtyping, matching does not support subsumption, but it …

The statement S≤ T in a λ-calculus with subtyping is traditionally interpreted by a semantic
coercion function of type [[S]]→[[T]] that extracts the “T part” of an element of S. If the …

Bounded operator abstraction is a language construct relevant to object oriented
programming languages and to ML2000, the successor to Standard ML. In this paper, we …

We give a direct type-theoretic characterization of the basic mechanisms of object-oriented
programming, including objects, methods, message passing, and subtyping, by introducing …

One of the basic ideas in programming is the notion of algorithm. An algorithm is a
description of the rules one must follow to accomplish a task. But for a machine to be able to …