strong typing

In computer science and computer programming, the term strong typing is used to describe those situations where programming languages specify one or more restrictions on how operations involving values having different datatypes can be intermixed. The antonym is weak typing. However, these terms have been given such a wide variety of meanings over the short history of computing that it is often difficult to know, out of context, what an individual writer means when using them.
See more at Wikipedia.org...

<programming> Strict enforcement of type rules with no exceptions. All types are known at compile time, i.e. are statically bound. With variables that can store values of more than one type, incorrect type usage can be detected at run time.
Strong typing catches more errors at compile time than weak typing, resulting in fewer run-time exceptions.
The languages Ada, Java, and Haskell are strongly typed. Pascal is (almost) strongly typed.
C and C++ are sometimes described as strongly typed, but are perhaps better described as weakly typed.
(2000-07-04)