Live briefing
Everything about Type inference
Automatic detection of the type of an expression in a formal language
In type theory, type inference is the automatic detection of the type of an expression. These include programming languages and mathematical type systems, but also natural languages in some branches of computer science and linguistics. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Type inferenceA 5-minute orientation
- Skim a recent paper: Cell type-specific inference of differential expression in spatial transcriptomicsInfluential work since 2022
- Pick up a classic book: Mathematical methods of specification and synthesis of software systems '85The most-reprinted book on the subject
- Read the landmark paper: Inference of Population Structure Using Multilocus Genotype DataCited 24,335 times
- Go sideways: Hindley–Milner type systemA closely related topic
- Go sideways: Type systemA closely related topic
📖 Definitions
Noun The automatic deduction of the type of an expression in a programming language.
🏆 Landmark papers (most cited)
Inference of Population Structure Using Multilocus Genotype Data
Inference of Population Structure Using Multilocus Genotype Data: Linked Loci and Correlated Allele Frequencies
Local type inference
Polymorphic type inference and containment
Type inference with polymorphic recursion
Polymorphic type, region and effect inference
Type inference for polymorphic references
Type inference with simple subtypes
🆕 Influential since 2022
Cell type-specific inference of differential expression in spatial transcriptomics
Interval type-2 fractional fuzzy inference systems: Towards an evolution in fuzzy inference systems
Polymorphic Type Inference for Dynamic Languages
Getting into the Flow: Towards Better Type Error Messages for Constraint-Based Type Inference
T2RFIS: type-2 regression-based fuzzy inference system
📚 Books worth reading
Mathematical methods of specification and synthesis of software systems '85Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- 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…
- Type system A programming language consists of a system of allowed sequences of symbols (constructs) together with rules that define how each construct is interpreted…
- 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…
- Value restriction In programming languages with Hindley–Milner type inference and imperative features, in particular the ML programming language family, the value restriction…
- Parametric polymorphism In programming languages and type theory, parametric polymorphism allows a single piece of code to be given a "generic" type, using variables in place…
- Simply typed lambda calculus The simply typed lambda calculus (λ→), a form of type theory, is a typed interpretation of the lambda calculus with only one type constructor (→) that…
- System F System F (also polymorphic lambda calculus or second-order lambda calculus) is a typed lambda calculus that introduces, to simply typed lambda calculus…
- Directional derivative In multivariable calculus, the directional derivative measures the instantaneous rate at which a function changes along a specified vector through a given…