static type checking
1Type system — Type systems Type safety Inferred vs. Manifest Dynamic vs. Static Strong vs. Weak Nominal vs. Structural Dependent typing Duck typing Latent typing Linear typing Uniqueness typing …
2Static — has several meanings:* Static electricity, a net charge of an object ** The triboelectric effect, e.g. from shoes rubbing carpet * White noise, a random signal with a flat power spectral density ** Noise (radio), a type of radio interference **… …
3Type safety — In computer science, type safety is a property of some programming languages that is defined differently by different communities, but most definitions involve the use of a type system to prevent certain erroneous or undesirable program behavior… …
4static typing — noun A system in which type checking is performed during compilation and not at run time, opposed to dynamic typing …
5Static testing — is a form of software testing where the software isn t actually used. This is in contrast to dynamic testing. It is generally not detailed testing, but checks mainly for the sanity of the code, algorithm, or document. It is primarily syntax… …
6Dependent type — Type systems Type safety Inferred vs. Manifest Dynamic vs. Static Strong vs. Weak Nominal vs. Structural Dependent typing Duck typing Latent typing Linear typing Uniqueness typing …
7Nominative type system — Type systems Type safety Inferred vs. Manifest Dynamic vs. Static Strong vs. Weak Nominal vs. Structural Dependent typing Duck typing Latent typing Linear typing Uniqueness typing …
8Anonymous type — Anonymous types are a feature of the C# 3.0, Visual Basic .NET 9.0, and Chrome 2.0 programming language that allows data types with named fields to be created implicitly from the code that requires it. This is an important feature for the SQL… …
9List of tools for static code analysis — This is a list of significant tools for static code analysis.Historical products* Lint the original static code analyzer of C code.Open source or Noncommercial products .NET (C#, VB.NET and all .NET compatible languages) *… …
10Bounds-checking elimination — In computer science, bounds checking elimination is a compiler optimization useful in programming languages or runtimes that enforce bounds checking, the practice of consistently checking every index into an array to verify that the index is… …
