static typing

static typing

(programming)
Enforcement of type rules at compile time rather than at run time. Static typing catches more errors at compile time than dynamic typing.

Ada, C, C++, Haskell, Java, and ML are examples of statically typed languages.

Statically typed languages may have strong typing or weak typing.
References in periodicals archive ?
Zero--a blend of static typing and dynamic metaprogramming.
While static typing is widely accepted as being necessary for secure program execution, dynamic typing is also viewed as being essential in some applications, particularly for distributed programming environments.
Additional Key Words and Phrases: Dynamic typing, marshalling, parametric polymorphism, static typing
Languages such as Ada [1979] and ML [1990] improve the flexibility of static typing by providing parametric polymorphism, that allows static type-checking of reusable software components which operate generically over data structures such as lists, sets, trees, etc.
Despite the aforesaid advantages of static typing, some form of dynamic (runtime) typing has been proposed for statically typed languages.
Although static typing is widely regarded as useful and necessary for large-scale programming, the need for some degree of dynamic typing has also been recognized.
Static typing is therefore unsuitable for dynamically typed languages such as Scheme.
The proof exploits the close correlation between the type schemes assigned by TypeOf and SoftTypeOf and between the static typing rules and the soft typing rules.
Strong static typing is an important language characteristic that affects design and is particularly easy to notice when dealing with container data structures.
Languages with strong static typing usually include the type of container elements in the type of the container, such as list <string> in C++ or string list in ML.