Magnus Lycka wrote: > I don't really know Haskell, so I can't really compare it > to Python. A smarter compiler can certainly infer types from > the code and assemble several implementations of an > algorithm, but unless I'm confused, this makes it difficult > to do the kind of dynamic linking / late binding that we do in > Python. How do you compile a dynamic library without locking > library users to specific types? I don't know. I am learning Haskell(and Python too), long way to go before I would get into the the usage you mentioned, if ever, be it Haskell or Python.
-- http://mail.python.org/mailman/listinfo/python-list
