Strongly-Typed Programming Language
Jump to navigation
Jump to search
A Strongly-Typed Programming Language is a programming language that enforces strict data typing rules.
- Context:
- It can be a Strongly-Typed Statically-Typed Programming Language.
- ...
- Example(s):
- Java Language.
- C++.
- Swift Language.
- Kotlin.
- TypeScript.
- ...
- Counter-Example(s):
- See: Strong Typing, Strongly-Typed, Dependently Typed Programming Language, Untyped Programming Language, Type Checking Algorithm.
References
2023
- chat
- A strongly-typed programming language is a programming language that is designed to enforce strict data typing rules.
- Other terms for strongly-typed programming languages include statically-typed programming languages, type-safe programming languages, and compile-time checked programming languages.
- Some of the characteristics of strongly-typed programming languages are:
- It can prevent type-related errors during compilation.
- It can provide more security by preventing data type mismatches.
- It can improve code reliability and maintainability.
- It can be used for large-scale projects as it is less prone to errors.
- Some associated concepts with strongly-typed programming languages are: Type inference, Data type coercion, Type checking.
2009
- http://en.wikipedia.org/wiki/Strongly_typed_programming_language
- 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 data types can be intermixed. Its 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 author means when using them.