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 …

Recursive types and bounded quantification are prominent features in many modern
programming languages, such as Java, C#, Scala or TypeScript. Unfortunately, the …

Capture calculus has recently been proposed as a solution to effect checking, achieved by
tracking the captured references of terms in the types. Boxes, along with the box and unbox …

This paper describes how to add first-class generic types---including mixins---to strongly-
typed OO languages with nominal subtyping such as Java and C#. A generic type system is" …

Исследование систем типов, а также языков программирования с точки зрения теории
типов, в последнее время превратилось в энергично развивающуюся научную …

Iso-recursive types are often taken as a type-theoretic model for type recursion as present in
many programming languages, eg, classes in object-oriented languages or algebraic …

A scalable programming language is one in which the same concepts can describe small as
well as large parts. Towards this goal, Scala unifies concepts from object and module …

Traditional class and object encodings are difficult to use in practical type-preserving
compilers because of the complexity of the encodings. We propose a simple typed …

Erasable coercions in System F-eta, also known as retyping functions, are well-typed eta-
expansions of the identity. They may change the type of terms without changing their …

Recursive types are a central element of typed programming languages. Object-oriented
programming would be impossible without recursion between classes or their instances' …