- Binary operations
- >
- Logical consequence
- >
- Inference
- >
- Type inference

- Fields of mathematics
- >
- Mathematical logic
- >
- Type theory
- >
- Type inference

- Formal methods
- >
- Program analysis
- >
- Static program analysis
- >
- Type inference

- Logic in computer science
- >
- Type theory
- >
- Type systems
- >
- Type inference

- Mathematical concepts
- >
- Mathematical structures
- >
- Type theory
- >
- Type inference

- Mathematical logic
- >
- Logic in computer science
- >
- Automated reasoning
- >
- Type inference

- Mathematical logic
- >
- Logic in computer science
- >
- Type theory
- >
- Type inference

- Mathematical logic
- >
- Type theory
- >
- Type systems
- >
- Type inference

- Mathematical objects
- >
- Mathematical structures
- >
- Type theory
- >
- Type inference

- Mathematical structures
- >
- Type theory
- >
- Type systems
- >
- Type inference

- Mathematics of computing
- >
- Logic in computer science
- >
- Automated reasoning
- >
- Type inference

- Mathematics of computing
- >
- Logic in computer science
- >
- Type theory
- >
- Type inference

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Type theory
- >
- Type inference

- Propositional calculus
- >
- Logical consequence
- >
- Inference
- >
- Type inference

- Theoretical computer science
- >
- Logic in computer science
- >
- Automated reasoning
- >
- Type inference

- Theoretical computer science
- >
- Logic in computer science
- >
- Type theory
- >
- Type inference

Hindley–Milner type system

A Hindley–Milner (HM) type system is a classical type system for the lambda calculus with parametric polymorphism. It is also known as Damas–Milner or Damas–Hindley–Milner. It was first described by J

Value restriction

In programming languages with Hindley-Milner type inference and imperative features, in particular the ML programming language family, the value restriction means that declarations are only polymorphi

Type inference

Type inference refers to the automatic detection of the type of an expression in a formal language. These include programming languages and mathematical type systems, but also natural languages in som

Principal type

In type theory, a type system is said to have the principal type property if, given a term and an environment, there exists a principal type for this term in this environment, i.e. a type such that al

© 2023 Useful Links.