Types describe a set of values. The expression
1 + 2 has the type
Int. This means if the expression is successfully evaluated, then the value will be one of the approximately 4.2 billion values the computer understands to be integers. (Integers are also known as "whole numbers".)
We determine the type of an expression without running it. This means that types are a property of expressions. We can give a type to an expression even if, when we evaluate it, the computation fails. This is also why the type doesn't tell us the specific value the expression evaluates to: we'd have to evalute the expression to know that.
Types are worked out in a process known as a type-checking, which is part of compilation. Before a Scala program is run, it must be compiled. Compilation checks that a program makes sense. It must be syntactically correct, meaning it must be written according to the rules of Scala. For example
(1 + 2) is syntactically correct, but
(1 + 2 is not because there is no
) to match the
(. It must also type check, meaning the types must be correct for the operations we're trying to do.
1 + 2 type checks (we are adding integers), but
1.toUpperCase does not (there is no concept of upper and lower case for integers.)
Only programs that successfully compile can be run. We can think of compilation as being analogous to the rules of grammar in writing. The sentence "FaRf fjrmn;l df.fd" is syntactically incorrect in English. The arrangement of letters doesn't form any words. The sentence "dog flying a here no" is made out of valid words but their arrangement breaks the rules of grammar, which is analogous to the type checks that Scala performs.