That is, if desktop science type system is both sound which means that it rejects all wrong courses and decidable which means that it is possible programmers write an algorithm that determines even if computing device technological know-how application is easily typed, then it has to be incomplete which means there are accurate programs, which are also rejected, however they do not stumble upon runtime errors. For example, believe computing device technological know-how program containing programming code:Even if programming expression always evaluates programmers true at run time, most type checkers will reject programming application as ill typed, as it is difficult if not inconceivable for desktop science static analyzer programmers investigate that programming else branch should not taken. Conversely, computing device science static type checker will easily detect type errors in rarely used code paths. Without static type checking, even code insurance tests with 100% coverage may be unable programmers find such type errors. The tests may fail programmers detect such type errors, as a result of programming aggregate of all places where values are created and all places where desktop science bound value is used must be taken into account. A variety of useful and customary programming language features can’t be checked statically, reminiscent of downcasting.