News for hackers. Stuff that matters.
Re:Dynamic languages are static languages by sophacles on Sunday March 20, 2011 @04:53PM (#2347373)
Here is why the article doesn't make sense to me: I frequently find that languages in the "dynamic" group (python, ruby, js, smalltalk etc) feel much, much more similar to languages in the "ultra strict" type group (haskell, ocaml, etc), than either do to say, the medium group (c(#|+)*, java). If the case were really that there is some sort of natural order along the type strictness lines, wouldn't it be that python felt closer to c than to haskell in terms of power and expressiveness?
Re:Dynamic languages are static languages by jerf on Sunday March 20, 2011 @07:35PM (#2347762)
What you're seeing there is the distinction between "manifest typing" [1] and "implicit typing" [2]. With manifest typing, you actually have to tell the compiler the specific type. With implicit, it will figure it out, either because (as discussed in the article) everything is the same type "Object", or because it will do type inference. Most modern type inference has started with Hindley-Milner [3], but move beyond it in various ways with varying degrees of justification and success. Raw HM doesn't seem to be enough to work with in practice, but moving beyond it gets you into the realm of undecidability unpleasantly quickly. But some progress is being made.

The C(/#/++)/Java languages had a lot of people convinced that being statically typed required manifest typing. Including me. I thought I was against static typing, what I was against was manifest typing.

[1]: http://en.wikipedia.org/wiki/Manifest_typing

[2]: http://en.wikipedia.org/wiki/Type_inference

[3]: http://en.wikipedia.org/wiki/Type_inference#Hindley.E2.80.93...

Re:Dynamic languages are static languages by prodigal_erik on Monday March 21, 2011 @12:33AM (#2348491)
Please don't use "strict" regarding a language's type checking. It's already used in domain theory for functions which rely on arguments being well-defined and computable. It is one of Haskell's defining features that by default, functions and data structures are not strict.

http://en.wikipedia.org/wiki/Domain_theory

http://en.wikibooks.org/wiki/Haskell/Denotational_semantics

Re:Dynamic languages are static languages by Ingaz on Sunday March 20, 2011 @07:24PM (#2347731)
Totally agree.

I think it's because "ultra strict" and "dynamic" both oriented on programmer. "Non-strict" oriented on compiler.

"Ultra strictness" and dynamic typing in different ways, but both gives help to programmer. Non-strict is just a pain without benefit.

Re:Dynamic languages are static languages by codebaobab on Sunday March 20, 2011 @05:19PM (#2347441)
How does Smalltalk get lumped with C and Java and not with Python and Ruby?
Re:Dynamic languages are static languages by sophacles on Sunday March 20, 2011 @05:22PM (#2347449)
Because I thought of it later and clicked in the wrong place and didn't notice. Thanks for the pointer. Editing parent.