Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
We present CSolve, an automated verifier for C programs based on Liquid Type inference. We show how CSolve verifies memory safety through an example and describe its architecture...
Patrick Maxim Rondon, Alexander Bakst, Ming Kawagu...
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that ...