Re^4: == and != don't work as expected

Assembly, C, C++ (where it copies C), and Java all have weak type systems, according to this definition.

Don't mistake a static system which requires knowing type information at compile time with a strong system which, when it has any meaning at all, usually means that you can't (or don't need to) subvert the type system.

If you have to cast to do your work, you have a weak type system.

Comment on Re^4: == and != don't work as expected

Replies are listed 'Best First'.
Re^5: == and != don't work as expected by Vautrin (Hermit) on Aug 27, 2004 at 15:51 UTC
Under your definition it does not sound as if any languages are strongly typed. I have always heard people refer to C, C++, and Java as "strongly typed" languages. Somebody's making a mistake with the definitions here though, and I have trouble accepting a definition of "typing" which does not allow any languages to be strongly typed... Want to support the EFF and FSF by buying cool stuff? Click here.	[reply]
Re^6: == and != don't work as expected by chromatic (Archbishop) on Aug 27, 2004 at 16:34 UTC
There are languages with good static type systems, including Haskell and ML. I suspect the people you overheard know nothing about these languages. For more information, see MJD's Strong Typing lecture slides or almost every other discussion on Lambda the Ultimate.	[reply]