fact 0 = 1
fact n = n * fact (n-1)
Now I ran it as fact 100 with signature Int - Int and with
Integer - Integer
In the first case I got 0 in about 3 seconds
[...]
And if that sounds like a unreal argument, consider representing and
storing Graham's number.
So, since computers are
On Wed, Aug 21, 2013 at 11:47 AM, Ketil Malde ke...@malde.org wrote:
On a more serious note, I accept that Int (and other limited precision
numbers) is a fact of life, and sometimes useful for performance
reasons.
I would have liked, however, to have a compiler option or some other way
to
but Integer is actually (if you're using GMP with your ghc):
Yes, that's tolerably well known. You only pay the space overhead
when you need it (like Lisp or Smalltalk). But you always pay the
time overhead.
I thought Integers can't be unboxed, regardless of their magnitude?
On Tue, Aug 20, 2013 at 6:37 AM, Richard A. O'Keefe o...@cs.otago.ac.nz wrote:
On 20/08/2013, at 3:43 AM, Kyle Miller wrote:
On Sun, Aug 18, 2013 at 8:04 PM, Richard A. O'Keefe o...@cs.otago.ac.nz
wrote:
The argument for twos-complement, which always puzzled me, is that the other
systems
Richard A. O'Keefe o...@cs.otago.ac.nz writes:
I think a better argument for twos complement is that you're just
doing all of your computations modulo 2^n (where n is 32 or 64 or
whatever), and addition and multiplication work as expected modulo
anything.
To me, that's not a better
On 20/08/2013, at 6:44 PM, Kyle Miller wrote:
By working as expected I actually just meant that they distribute (as in
a(b+c)=ab+ac) and commute (ab=ba and a+b=b+a),
That is a tiny fraction of working as expected.
The whole modular arithmetic argument would come close to
having some virtue,
On Sun, Aug 18, 2013 at 8:04 PM, Richard A. O'Keefe o...@cs.otago.ac.nzwrote:
The argument for twos-complement, which always puzzled me, is that the
other
systems have two ways to represent zero. I never found this to be a
problem,
not even for bitwise operations, on the B6700. I *did*
On Mon, Aug 19, 2013 at 11:43 AM, Kyle Miller kmill31...@gmail.com wrote:
Or, three other options: 1) make MIN_INT outside the domain of abs, 2)
make the range of abs be some unsigned int type, or 3) use Integer (i.e.,
use a type which actually represents integers rather than a type which can
On 20/08/2013, at 3:43 AM, Kyle Miller wrote:
On Sun, Aug 18, 2013 at 8:04 PM, Richard A. O'Keefe o...@cs.otago.ac.nz
wrote:
The argument for twos-complement, which always puzzled me, is that the other
systems have two ways to represent zero. I never found this to be a problem,
not even
The docs at
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Prelude.html#v:gcd
give a NB mentioning that (abs minBound == minBound) is possible for
fixed-width types.
This holds, for example, at Int. It is also the case that (negate minBound
== minBound).
Two questions:
1) This
On 19/08/2013, at 3:38 AM, Nicolas Frisby wrote:
The docs at
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Prelude.html#v:gcd
give a NB mentioning that (abs minBound == minBound) is possible for
fixed-width types.
At least three ways to represent negative integers in
11 matches
Mail list logo
