Type-Directed Completion of Partial Expressions
Modern programming frameworks provide enormous libraries arranged in complex structures, so much so that a large part of modern programming is searching for APIs that "Surely exist" somewhere in an unfamiliar part of the framework. The authors present a novel way of phrasing a search for an unknown API: the programmer simply writes an expression leaving holes for the parts they do not know. These expressions are called partial expressions. They present an efficient algorithm that produces likely completions ordered by a ranking scheme based primarily on the similarity of the types of the APIs suggested to the types of the known expressions.