Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Many general-purpose, object-oriented scripting languages are dynamically typed, which provides flexibility but leaves the… Expand
  • figure 1
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2006
Highly Cited
2006
In languages where the compiler performs no static type checks, many programs never go wrong, but the intended use of functions… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2005
Highly Cited
2005
Object-oriented scripting languages like Javascript and Python are popular partly because of their dynamic features. These… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2002
Highly Cited
2002
A type system is a syntactic method for automatically checking the absence of certain erroneous behaviors by classifying program… Expand
  • figure 3-2
  • figure 11-2
  • figure 11-6
  • figure 11-7
  • figure 11-9
Highly Cited
2001
Highly Cited
2001
We present a type system for a language based on F≤, which allows certain type annotations to be elided in actual programs. Local… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Highly Cited
1999
Highly Cited
1999
In this paper we present a general framework HM(X) for Hindley/Milner style type systems with constraints, analogous to the CLP(X… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 8
Highly Cited
1998
Highly Cited
1998
We study two partial type inference methods for a language combining subtyping and impredicative polymorphism. Both methods are… Expand
Highly Cited
1998
Highly Cited
1998
We introduce basic language constructs and a type discipline as a foundation of structured communication-based concurrent… Expand
  • figure 1
  • figure 5
Highly Cited
1993
Highly Cited
1993
We present a general algorithm for solving systems of inclusion constraints over type expressions. The constraint language… Expand