Typed And Untyped Languages

Collapse
X
 
  • Time
  • Show
Clear All
new posts
  • Ruby17
    Member
    • Sep 2008
    • 56

    Typed And Untyped Languages

    TYPED LANGUAGES

    A language is typed if the specification of every operation defines types of data to which the operation is applicable, with the implication that it is not applicable to other types.[14] For example, "this text between the quotes" is a string. In most programming languages, dividing a number by a string has no meaning. Most modern programming languages will therefore reject any program attempting to perform such an operation. In some languages, the meaningless operation will be detected when the program is compiled ("static" type checking), and rejected by the compiler, while in others, it will be detected when the program is run ("dynamic" type checking), resulting in a runtime exception.

    A special case of typed languages are the single-type languages. These are often scripting or markup languages, such as Rexx or SGML, and have only one data type — most commonly character strings which are used for both symbolic and numeric data.

    UNTYPED LANGUAGES

    In contrast, an untyped language, such as most ***embly languages, allows any operation to be performed on any data, which are generally considered to be sequences of bits of various lengths.[14] High-level languages which are untyped include BCPL and some varieties of Forth.

    In practice, while few languages are considered typed from the point of view of type theory (verifying or rejecting all operations), most modern languages offer a degree of typing.[14] Many production languages provide means to byp*** or subvert the type system.
Working...
😀
😂
🥰
😘
🤢
😎
😞
😡
👍
👎