The current release of C] (version 2.0) introduces a number of new features intended to increase the expressivity of the language. The most significant is the addition of generics; classes, interfaces, delegates and methods can all be parameterized on types. To make using generic methods easier, C] allows the programmer to drop the type arguments in method invocations, and the compiler implements “type inference ” to reconstruct the arguments. Unfor-tunately this part of the published language specification is a little terse, and hence this feature can often behave in surprising ways for the programmer. Moreover, this process is quite different from the better known one implemented in Java 5.0. In this paper we at-tempt a formal reconstruct...
International Workshop on Smalltalk TechnologiesInternational audienceDynamically typed languages pr...
The latest versions of AspectJ { the most popular aspect oriented extension for Java { must cope wit...
In this paper we propose a scheme that combines type inference and run-time checking to make existin...
We propose the inclusion of the so-called auto feature for variable definitions and function types i...
We describe a framework for adding type qualifiers to a language. Type qualifiers encode a simple bu...
C already has a variaty of interfaces for type-generic programming, but lacks a systematic approach ...
Abstract. With the introduction of Java 5.0 [1] the type system has been extended by parameterized t...
AbstractType inference is the compile-time process of reconstructing missing type information in a p...
Abstract. The more expressive a type system, the more type information has to be provided in a progr...
We describe a framework for adding type qualifiers to a lan-guage. Type qualifiers encode a simple b...
In this work we describe both a type checking and a type inference algorithm for generic programming...
This article presents the new type inference features of the up-coming C++ standard. The main focus ...
Type inference is a key component of modern statically typed programming languages. It allows progra...
This thesis begins with an overview of type systems: evolution, concepts, and problems. This survey ...
The C language, despite its age, is one of the main languages in systems development. It is valued f...
International Workshop on Smalltalk TechnologiesInternational audienceDynamically typed languages pr...
The latest versions of AspectJ { the most popular aspect oriented extension for Java { must cope wit...
In this paper we propose a scheme that combines type inference and run-time checking to make existin...
We propose the inclusion of the so-called auto feature for variable definitions and function types i...
We describe a framework for adding type qualifiers to a language. Type qualifiers encode a simple bu...
C already has a variaty of interfaces for type-generic programming, but lacks a systematic approach ...
Abstract. With the introduction of Java 5.0 [1] the type system has been extended by parameterized t...
AbstractType inference is the compile-time process of reconstructing missing type information in a p...
Abstract. The more expressive a type system, the more type information has to be provided in a progr...
We describe a framework for adding type qualifiers to a lan-guage. Type qualifiers encode a simple b...
In this work we describe both a type checking and a type inference algorithm for generic programming...
This article presents the new type inference features of the up-coming C++ standard. The main focus ...
Type inference is a key component of modern statically typed programming languages. It allows progra...
This thesis begins with an overview of type systems: evolution, concepts, and problems. This survey ...
The C language, despite its age, is one of the main languages in systems development. It is valued f...
International Workshop on Smalltalk TechnologiesInternational audienceDynamically typed languages pr...
The latest versions of AspectJ { the most popular aspect oriented extension for Java { must cope wit...
In this paper we propose a scheme that combines type inference and run-time checking to make existin...