Statically-Typed Programming Language

A Statically-Typed Programming Language is a programming language that requires programming variables to be named and typed before they are used.

• Context:
  • It can (often) attempt to be a Type-Safe Programming Language.
  • It can be a Strongly-Typed Statically-Typed Programming Language.
  • ...
• Example(s):
  • Java Language.
  • Scala Language.
  • Kotlin Language.
  • Go Language, except when it allows for implicit type conversion.
  • TypeScript, except when it supports optional dynamic typing through its "any" type and the "unknown" type.
  • …
• Counter-Example(s):
  • a Dynamically Typed Programming Language.
  • an Untyped Programming Language.
• See: Data Type, Static Typing, Statically-Typed, Dependently Typed Programming Language, Type Checking Algorithm.

---

---

References

2013

• (Wikipedia, 2013) ⇒ http://en.wikipedia.org/wiki/Type_system#Programming_style Retrieved:2013-12-12.
  • Some programmers prefer statically typed languages; others prefer dynamically typed languages. Statically typed languages alert programmers to type errors during compilation, and they may perform better at runtime. Advocates of dynamically typed languages claim they better support rapid prototyping and that type errors are only a small subset of errors in a program. Likewise, there is often no need to manually declare all types in statically typed languages with type inference; thus, the need for the programmer to explicitly specify types of variables is automatically lowered for such languages; and some dynamic languages have run-time optimizers that can generate fast code approaching the speed of static language compilers, often by using partial type inference.

2010

• (Java, 2010) ⇒ http://download.oracle.com/javase/tutorial/java/nutsandbolts/datatypes.html
  • The Java programming language is statically-typed, which means that all variables must first be declared before they can be used. This involves stating the variable's type and name,

---