We study two partial type inference methods for a language combining subtyping and
impredicative polymorphism. Both methods are local in the sense that missing annotations …

Milner, Parrow, and Walker's π-calculus [MPW92, Mil91] generalizes the channel-based
communication of CCS and its relatives by allowing channels to be passed as data along …

Recent years have seen the development of several foundational models for statically typed
object-oriented programming. But despite their intuitive similarity, differences in the technical …

We present an internal language with equivalent expressive power to Standard ML, and
discuss its formalization in LF and the machine-checked verification of its type safety in …

We introduce a concise pi-calculus with directed choices and develop a theory of subtyping.
Built on a simple behavioural intuition, the calculus offers exact semantic analysis of the …

Recent years have seen the development of several foundational models for statically typed
object-oriented programming. But despite their intuitive similarity, differences in the technical …

With Java 5 and C# 2.0, first-order parametric polymorphism was introduced in mainstream
object-oriented programming languages under the name of generics. Although the first …

We present a way to restrict recursive inheritance without sacrificing the benefits of F-
bounded polymorphism. In particular, we distinguish two new concepts, materials and …

We investigate the algorithmics of subtyping in the presence of nominal inheritance and
variance for generic types, as found in Java 5, Scala 2.0, and the .NET 2.0 Intermediate …

This thesis is on termination of computer programs. By termination we mean that the task
given to a computer is processed in a certain amount of time, as opposed to taking infinitely …