This article discusses the problem of constraint-set satisfiability (CSSAT)---that is, the
problem of determining whether a given constraint-set is satisfiable in a given typing context …

Program analysis aims to predict program behaviors already at compile time. For instance,
one could ask how many memory resources are required or in which range the program …

Generalized algebraic data types (GADTs) are a type system extension to algebraic data
types that allows the type of an algebraic data value to vary with its shape. The GADT type …

Expansion is an operation on typings (ie, pairs of typing environments and result types)
defined originally in type systems for the λ-calculus with intersection types in order to obtain …

The type system of Haskell and some related systems are based on an open world
approach for overloading. In an open world, the principal type of each overloaded symbol …

This article addresses the problem of type inference in the presence of context-dependent
overloading and parametric polymorphism, using a revised definition of system CT [2]—a …