Am 17.02.18 um 05:54 schrieb boB Stepp:
And this is one I
am still puzzling over: Are statically-typed languages inherently
"safer" than properly implemented dynamically-typed languages? I can
see the advantages of catching type errors at compile time versus run
time.
If you haven't tried so far, try to write a few small programs in
Haskell. You will find that the excellent type system catches many
errors at compile time. Haskell works very well for computations, like
graph algorithms and such. My experience playing with it was that after
getting the program to compile, most errors were usually eliminated.
What remains are things like off-by-one errors, but also these are
usually less if you write your algorithms recursively.
OTOH Haskell is extremely tedious to use for anything I/O related,
because inherently I/O is not "functional" and some extremely convoluted
thing ("IO monads") had to be erected to make the nicely mathematical
"pure" world interface with the dirty reality out there.
Christian
--
https://mail.python.org/mailman/listinfo/python-list
