This paper describes a reduction from the halting problem of Turing machines to subtype
checking in Java. It follows that subtype checking in Java is undecidable, which answers a …

Programming languages that support multiple dispatch rely on an expressive notion of
subtyping to specify method applicability. In these languages, type annotations on method …

Julia is a modern scientific-computing language that relies on multiple dispatch to implement
generic libraries. While the language does not have a static type system, method …

Dependent Object Types (DOT) is a calculus with path dependent types, intersection types,
and object self-references, which serves as the core calculus of Scala 3. Although the …

The Julia programming language was designed to fill the needs of scientific computing by
combining the benefits of productivity and performance languages. Julia allows users to …

Wildcards have become an important part of Java's type system since their introduction 7
years ago. Yet there are still many open problems with Java's wildcards. For example, there …

Path dependent types have long served as an expressive component of the Scala
programming language. They allow for the modelling of both bounded polymorphism and a …

The language JavaGI extends Java 1.5 conservatively by a generalized interface
mechanism. The generalization subsumes retroactive and type-conditional interface …

Julia is a dynamic, high-performance programming language for scientific computing. To
encourage a high level of code reuse and extensibility, Julia is designed around symmetric …

Java introduced wildcards years ago. Wildcards were very expressive, and they were
integral to updating the existing libraries to make use of generics. Unfortunately, wildcards …