International audienceThe lack of static type information is one of the main obstacles to program comprehension in dynamically-typed languages. While static type inference algorithms try to remedy this problem, they usually suffer from the problem of false positives or false negatives. In order to partially compensate for the lack of static type information, a common practice in dynamically-typed languages is to name or annotate method arguments in such a way that they reveal their expected type, e.g., aString, anInt, or string: String. Recent studies confirmed that these type annotations are indeed frequently used by developers in dynamically-typed languages. We propose a lightweight heuristic that uses these hints from method argument nam...
We present a type inference system for FL based on an operational, rather than a denotational, formu...
We present a simple and powerful type inference method for dynamically typed languages where no type...
Type inference and type reconstruction derive static types for program elements that have no static...
The lack of static type information is one of the main obstacles to program comprehension in dynamic...
Although dynamically typed languages allow developers to be more productive in writing source code, ...
Dynamically-typed languages allow faster software development by not posing the type constraints. St...
Abstract—A common practice when writing Smalltalk source code is to name method arguments in a way t...
Dynamically typed languages allow developers to write more expressive source code, but their lack of...
Dynamically typed languages lack information about the types of variables in the source code. Develo...
Highly dynamic languages like Smalltalk do not have much static type information immediately availab...
Most languages fall into one of two camps: either they adopt a unique, static type system, or they a...
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides th...
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides th...
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations i...
One of the main obstacles to program comprehension and software maintenance is the lack of informati...
We present a type inference system for FL based on an operational, rather than a denotational, formu...
We present a simple and powerful type inference method for dynamically typed languages where no type...
Type inference and type reconstruction derive static types for program elements that have no static...
The lack of static type information is one of the main obstacles to program comprehension in dynamic...
Although dynamically typed languages allow developers to be more productive in writing source code, ...
Dynamically-typed languages allow faster software development by not posing the type constraints. St...
Abstract—A common practice when writing Smalltalk source code is to name method arguments in a way t...
Dynamically typed languages allow developers to write more expressive source code, but their lack of...
Dynamically typed languages lack information about the types of variables in the source code. Develo...
Highly dynamic languages like Smalltalk do not have much static type information immediately availab...
Most languages fall into one of two camps: either they adopt a unique, static type system, or they a...
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides th...
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides th...
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations i...
One of the main obstacles to program comprehension and software maintenance is the lack of informati...
We present a type inference system for FL based on an operational, rather than a denotational, formu...
We present a simple and powerful type inference method for dynamically typed languages where no type...
Type inference and type reconstruction derive static types for program elements that have no static...