If you accept the modern notion of types as proofs, dynamic languages are correctly described as untyped since they prove nothing about the code they run. Unfo

If you accept the modern notion of types as proofs, dynamic languages are correctly described as untyped since they prove nothing about the code they run. Unfortunately the term "type" is also used to refer to the tags dynamic languages put on data to prevent illegal operations. Confusion inevitably results.