A Formal Description Of A Type Checking Algorithm


In type system theory, a program variable can assume a range of values during the execution of a program. In a statically typed language, every expression of the language is assigned a type at compile time. There are many advantages to having a statically type-checked language including provision of earlier information on programming errors, documenting… (More)
DOI: 10.5381/jot.2005.4.9.a2