Type inference

Known as: Type reconstruction, Inferred typing, Typability 
Type inference refers to the automatic deduction of the data type of an expression in a programming language. If some, but not all, type annotations… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper presents a type-based information flow analysis for a call-by-value λ-calculus equipped with references, exceptions… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper we present a general framework HM(X) for Hindley/Milner style type systems with constraints. We give a generic type… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We study two partial type inference methods for a language combining subtyping and impredicative polymorphism. Both methods are… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The Damas-Milner Calculus is the typed A-calculus underlying the type system for ML and several other strongly typed polymorphic… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We present a general algorithm for solving systems of inclusion constraints over type expressions. The constraint language… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 8
Is this relevant?
Highly Cited
1991
Highly Cited
1991
ion clause, we use A -{x: σ} to denote the set difference, i.e., the type assignment defined by removing x: σ from A. G(x) = { s… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
A simple semantic model of automatic coercion is proposed. This model is used to explain four rules for inferring polymorphic… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
The benefits of strong typing to disciplined programming, tocompile-time error detection and to program verification are… (More)
Is this relevant?