We present a general algorithm for solving systems of inclusion constraints over type
expressions. The constraint language includes function types, constructor types, and liberal …

In order to contribute to the solution of the software reliability problem, tools have been
designed to analyze statically the run-time behavior of programs. Because the correctness …

We present a simple and powerful type inference method for dynamically typed languages
where no type information is supplied by the user. Type inference is reduced to the problem …

We present the dynamically typed λ-calculus, an extension of the statically typed λ-calculus
with a special type Dyn and explicit dynamic type coercions corresponding to run-time type …

Intersection and union types are becoming more popular by the day, entering the
mainstream in programming languages like TypeScript and Scala 3. Yet, no language so far …

Subty** in the presence of recursive types for the λ-calculus was studied by Amadio and
Cardelli in 1991 [1]. In that paper they showed that the problem of deciding whether one …

Flow-based safety analysis of higher-order languages has been studied by Shivers, and
Palsberg and Schwartzbach. Open until now is the problem of finding a type system that …

We define a powerful type inference mechanism with application to object-oriented
programming. The types inferred are recursively constrained types, types that come with a …

We present a core calculus with two of X10's key constructs for parallelism, namely async
and finish. Our calculus forms a convenient basis for type systems and static analyses for …

We prove that trace equivalence is undecidable for the very small and natural subclass of
Petri nets in which no transition requires more than one token; this subclass corresponds …