Dynamically typed languages lack information about the types of variables in the source code. Developers care about this information as it supports program comprehension. Ba- sic type inference techniques are helpful, but may yield many false positives or negatives. We propose to mine information from the software ecosys- tem on how frequently given types are inferred unambigu- ously to improve the quality of type inference for a single system. This paper presents an approach to augment existing type inference techniques by supplementing the informa- tion available in the source code of a project with data from other projects written in the same language. For all available projects, we track how often messages are sent to instance variables...
In a typical COBOL program, the data division consists of 50 % of the lines of code. Automatic type ...
A partial type inference technique should come with a simple and precise specification, so that user...
We present a simple and powerful type inference method for dynamically typed languages where no type...
Dynamically typed languages allow developers to write more expressive source code, but their lack of...
Although dynamically typed languages allow developers to be more productive in writing source code, ...
One of the main obstacles to program comprehension and software maintenance is the lack of informati...
The lack of static type information in dynamically-typed languages often poses obstacles for develop...
International Workshop on Smalltalk TechnologiesInternational audienceDynamically typed languages pr...
Highly dynamic languages like Smalltalk do not have much static type information immediately availab...
The lack of static type information is one of the main obstacles to program comprehension in dynamic...
Dynamically-typed languages allow faster software development by not posing the type constraints. St...
We present a type inference system for FL based on an operational, rather than a denotational, formu...
Type inference and type reconstruction derive static types for program elements that have no static...
Types are a good starting point for various software reengineering tasks. Unfortunately, programs re...
Types are a good starting point for various software reengineering tasks. Unfortunately, programs re...
In a typical COBOL program, the data division consists of 50 % of the lines of code. Automatic type ...
A partial type inference technique should come with a simple and precise specification, so that user...
We present a simple and powerful type inference method for dynamically typed languages where no type...
Dynamically typed languages allow developers to write more expressive source code, but their lack of...
Although dynamically typed languages allow developers to be more productive in writing source code, ...
One of the main obstacles to program comprehension and software maintenance is the lack of informati...
The lack of static type information in dynamically-typed languages often poses obstacles for develop...
International Workshop on Smalltalk TechnologiesInternational audienceDynamically typed languages pr...
Highly dynamic languages like Smalltalk do not have much static type information immediately availab...
The lack of static type information is one of the main obstacles to program comprehension in dynamic...
Dynamically-typed languages allow faster software development by not posing the type constraints. St...
We present a type inference system for FL based on an operational, rather than a denotational, formu...
Type inference and type reconstruction derive static types for program elements that have no static...
Types are a good starting point for various software reengineering tasks. Unfortunately, programs re...
Types are a good starting point for various software reengineering tasks. Unfortunately, programs re...
In a typical COBOL program, the data division consists of 50 % of the lines of code. Automatic type ...
A partial type inference technique should come with a simple and precise specification, so that user...
We present a simple and powerful type inference method for dynamically typed languages where no type...