Lesson plan
Type inference
In type theory, type inference (sometimes called type reconstruction) 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. Typeability is sometimes used quasi-synonymously with type inference, however some authors make a distinction between typeability as a decision problem (that has yes/no answer) and type inference as the computation of an actual type for a term.
Article summary
In type theory, type inference (sometimes called type reconstruction) 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. Typeability is sometimes used quasi-synonymously with type inference, however some authors make a distinction between typeability as a decision problem (that has yes/no answer) and type inference as the computation of an actual type for a term.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.