In type theory, a type rule is an inference rule that describes how a type system assigns a type to a syntactic construction. These rules may be applied by the type system to determine if a program is well typed and what type expressions have. A prototypical example of the use of type rules is in defining type inference in the simply typed lambda calculus, which is the internal language of Cartesian closed categories.
The sequents above the line are the premises that must be fulfilled for the rule to be applied, yielding the conclusion: the sequents below the line. This can be read as: if expression has type in environment , for all , then the expression will have an environment and type .
For example, a simple language to perform arithmetic calculations on real numbers may have the following rules
A type rule may have no premises, and usually the line is omitted in these cases. A type rule may also change an environment by adding new variables to a previous environment; for example, a declaration may have the following type rule, where a new variable , with type , is added to :
This types can be used to derive composed expressions types, much like in natural deduction.
See also↑Jump back a section
- Luca Cardelli, "Type Systems", ACM Computing Surveys
|This programming language theory or type theory-related article is a stub. You can help Wikipedia by expanding it.|