Static dependent types are the basis of a new type system that permits types and values to
be packaged together into first class modules. Unlike other approaches to modules, static …

Abstract Types express properties of programs; typechecking is specification checking.
However, the specifications expressed by types in conventional type systems are imprecise …

Modern object-oriented languages such as X10 require a rich framework for types capable
of expressing both value-dependency and genericity, and supporting pluggable, domain …

Strong, static typing is useful because it can improve the readability, reliability and
optimizability of programs. The usability of an object may change over time. However …

Abstract The framework Pure Type System (PTS) offers a simple and general approach to
designing and formalizing type systems. However, in the presence of dependent types, there …

T $'e describe a refinement of ML's type system allowing the specification of recursively
defined subtypes of user-defined datatypes. The resulting system of rejirzemeni f, ypes …

Dependent types reflect the fact that validity of data is often a relative notion by allowing prior
data to affect the types of subsequent data. Not only does this make for a precise type …

We currently see a convergence of module systems and type systems for object-oriented
programming. This convergence is driven by the demands of large scale component …

Polymorphic type systems as proposed by Milner and implemented in the programming
language ML offer rich types, unobtrusive compile-time type-checking and complete type …

Quantitative typing integrates resource usage tracking into the type system. The prime
example is linear lambda-calculus that requires that each variable is used exactly once …