Isaac Dupree wrote:
Derek Elkins wrote:
and you can have
unboxed values in dynamically typed languages.
really? Sure that's possible as an optimization, but I thought that to
explicitly specify that would require a known static type. Or perhaps
the bit-tagging by which some Scheme
Michael Reid wrote:
The
power of Haskell's type system makes it feel like you are programming in
a dynamic language to some degree, yet all of it is type-checked, and
that is just *really* cool.
to some degree, (in current Haskell compilers), it *is* more like a
dynamic than a static
Derek Elkins wrote:
On Sat, 2008-01-26 at 20:49 -0500, Isaac Dupree wrote:
Michael Reid wrote:
The
power of Haskell's type system makes it feel like you are programming in
a dynamic language to some degree, yet all of it is type-checked, and
that is just *really* cool.
to some degree, (in
