类型系统是编程语言的基石

类型系统是编程语言的基石

Type systems are generally formulated as collections of rules for checking the “con- sistency” of programs. 

This kind of checking exposes not only trivial mental slips, but also deeper conceptual errors, which frequently manifest as type errors. 

A useful—though rough—distinction divides the world of programming lan- guages into two parts:

 

• 􏰅  Untyped — programs simply execute flat out; there is no attempt to check

  “consistency of shapes”

• 􏰅  Typed — some attempt is made, either at compile time or at run-time, to check shape-consistency

  Among typed languages, we can break things down further: 

http://ropas.snu.ac.kr/~kwang/520/pierce_book.pdf

 

《

Type Systems
for Programming Languages

》