Quotes from Benjamin C. Pierce

A type system can be regarded as calculating a kind of static approximation to the run-time behaviours of the terms in a program.

Q: Why bother doing proofs about programming languages? They are almost always boring if the definitions are right. A: The definitions are almost always wrong. - Anonymous