Hi!
Why is 0/0 (which is NaN) 1 == False and at the same time 0/0 1 ==
False. This means that 0/0 == 1? No, because also 0/0 == 1 == False.
I understand that proper mathematical behavior would be that as 0/0 is
mathematically undefined that 0/0 cannot be even compared to 1.
There is probably
On Thu, 10 Jan 2008 10:22:03 +0200, Mitar [EMAIL PROTECTED] wrote:
Hi!
Why is 0/0 (which is NaN) 1 == False and at the same time 0/0 1 ==
False. This means that 0/0 == 1? No, because also 0/0 == 1 == False.
I understand that proper mathematical behavior would be that as 0/0 is
Hi Mitar,
On Jan 10, 2008 9:22 AM, Mitar [EMAIL PROTECTED] wrote:
I understand that proper mathematical behavior would be that as 0/0 is
mathematically undefined that 0/0 cannot be even compared to 1.
My understanding is that common mathematical practice is that
comparing an undefined value to
On Thu, 10 Jan 2008 10:48:51 +0200, Benja Fallenstein
[EMAIL PROTECTED] wrote:
Hi Mitar,
On Jan 10, 2008 9:22 AM, Mitar [EMAIL PROTECTED] wrote:
I understand that proper mathematical behavior would be that as 0/0 is
mathematically undefined that 0/0 cannot be even compared to 1.
My
On Thu, 10 Jan 2008 10:48:51 +0200, Benja Fallenstein
[EMAIL PROTECTED] wrote:
Hi Mitar,
On Jan 10, 2008 9:22 AM, Mitar [EMAIL PROTECTED] wrote:
I understand that proper mathematical behavior would be that as 0/0 is
mathematically undefined that 0/0 cannot be even compared to 1.
My
Mitar wrote:
Why is 0/0 (which is NaN) 1 == False and at the same time 0/0 1 ==
False. This means that 0/0 == 1? No, because also 0/0 == 1 == False.
I understand that proper mathematical behavior would be that as 0/0 is
mathematically undefined that 0/0 cannot be even compared to 1.
and there is no such thing as the same bottom right ?
On Thu, 10 Jan 2008 11:13:05 +0200, Ketil Malde [EMAIL PROTECTED]
wrote:
Cristian Baboi [EMAIL PROTECTED] writes:
I think it's a bug.
Here is why:
let f = (\x - x/0) in f 0 == f 0
Referential transparency say that f 0 must equal to f
Cristian Baboi wrote:
and there is no such thing as the same bottom right ?
Yes and no. Semantically, every bottom is the same.
However, the Haskell Report makes bottom an explicit
exceptional case. Compilers are allowed to do whatever
they want with bottoms, including different results for
Cristian Baboi [EMAIL PROTECTED] writes:
I think it's a bug.
Here is why:
let f = (\x - x/0) in f 0 == f 0
Referential transparency say that f 0 must equal to f 0, but in this
case it is not. :-)
I think you are wrong. Referential transparency says that you can
replace any occurence of
On Thu, 10 Jan 2008 11:23:51 +0200, Yitzchak Gale [EMAIL PROTECTED] wrote:
Cristian Baboi wrote:
and there is no such thing as the same bottom right ?
Yes and no.
Semantically, Yes and No is bottom ?
Information from NOD32
This message was checked by NOD32 Antivirus
Yitzchak Gale wrote:
Mitar wrote:
Why is 0/0 (which is NaN) 1 == False and at the same time 0/0 1 ==
False. This means that 0/0 == 1? No, because also 0/0 == 1 == False.
I understand that proper mathematical behavior would be that as 0/0 is
mathematically undefined that 0/0 cannot be even
Cristian Baboi wrote:
and there is no such thing as the same bottom right ?
I wrote:
Yes and no.
Semantically, Yes and No is bottom ?
Yes and no.
-Yitz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Cristian Baboi wrote:
I think this should be put this way:
Bottom is a part of the semantic domain which is not Haskell.
Rather, something outside Haskell that describes
what Haskell programs mean. Yes.
In the semantic domain there is one bottom.
In Haskell there are many expressions that
I wrote:
Like nearly all programming languages, Haskell implements
the standard IEEE behavior for floating point numbers.
That leads to some mathematical infelicities that are
especially irking to us in Haskell, but the consensus was
that it is best to follow the standard.
Jules Bean wrote:
Adding the following to my lighttpd config (on Ubuntu Feisty) solves
the problem from the server side:
external configuration files
## mimetype mapping
# change mime type for haskell source files so they get displayed
# inside the browser
include_shell
Yitzchak Gale [EMAIL PROTECTED] writes:
In the semantic domain there is one bottom.
In Haskell there are many expressions that represent bottom.
One cannot test those for equality.
If we are being pedantic, I can define
data Foo = Foo
instance Eq Foo where _ == _ = True
On Thu, 10 Jan 2008, Ketil Malde wrote:
I think you mean that they cannot be bottom if you want
to compare them for equality. Yes.
See above. What is the precise term for describing this? Structural
equality?
On the other hand, some bottoms are exceptions, you may be able to
catch
On 10/01/2008, Galchin Vasili [EMAIL PROTECTED] wrote:
Hello,
I have been reading with great interested Tim Sweeney's slides on the
Next Generation Programming Language. Does anybody know his email address?
Vasili is referring to these slides, which will probably interest many
people on
Hello,
I have little practice in Haskell. And I look forward for suggestions on how
to improve the code. Code is not working: some definitions are missed.
The goal of the code is to implement the evaluator for untyped lambda-calculus.
The main problem is how to display each step of reduction?
Nick Rolfe [EMAIL PROTECTED] wrote:
http://morpheus.cs.ucdavis.edu/papers/sweeny.pdf
He refers to Haskell and its strengths (and some of its weaknesses)
quite a bit.
For those who don't know him, Tim Sweeney is the main programmer
behind Epic Games's popular Unreal Engine. When he talks,
On Jan 10, 2008 11:51 AM, Achim Schneider [EMAIL PROTECTED] wrote:
Nick Rolfe [EMAIL PROTECTED] wrote:
http://morpheus.cs.ucdavis.edu/papers/sweeny.pdf
He refers to Haskell and its strengths (and some of its weaknesses)
quite a bit.
For those who don't know him, Tim Sweeney is the
2008/1/10, Alfonso Acosta [EMAIL PROTECTED]:
On Jan 8, 2008 1:28 PM, David Waern [EMAIL PROTECTED] wrote:
Dear Haskell community,
I'm proud to announce the release of Haddock 2.0.0.0!
Great! I already tested a dracs spanshot before the release and seemed
to work well with TH code.
Any
Johan Tibell wrote:
Adding the following to my lighttpd config (on Ubuntu Feisty) solves
the problem from the server side:
external configuration files
## mimetype mapping
# change mime type for haskell source files so they get displayed
# inside the browser
include_shell
On Jan 10, 2008 12:41 PM, Achim Schneider [EMAIL PROTECTED] wrote:
Sebastian Sylvan [EMAIL PROTECTED] wrote:
For those who don't know him, Tim Sweeney is the main programmer
behind Epic Games's popular Unreal Engine. When he talks, many
game developers will listen.
We will
Should be straight forwardsimplest example is...
class A a
data D = D1
instance A D
fine.D is declared to be a member of type class A
what about.
class A a
type T = (forall x.Num x=x)
instance A T
error!...
Illegal polymorphic or qualified type: forall x. (Num x) = x
Sebastian Sylvan [EMAIL PROTECTED] wrote:
For those who don't know him, Tim Sweeney is the main programmer
behind Epic Games's popular Unreal Engine. When he talks, many
game developers will listen.
We will dream, most likely.
Perhaps more importantly, anything he does
will
class A a
type T = (forall x.Num x=x)
instance A T
type declares a synonym, like #define in C - but working only on types. So,
essentially, you wrote
instance A (forall x.Num x = x)
which is not very Haskelly.
I am simply trying to state that all members of typeclass Num are of
typeclass
On Jan 10, 2008 1:03 PM, Nicholls, Mark [EMAIL PROTECTED] wrote:
Should be straight forwardsimplest example is...
class A a
data D = D1
instance A D
fine.D is declared to be a member of type class A
what about.
class A a
type T = (forall x.Num x=x)
instance A T
Thanks for your response, I think you helped me on one of my previous
abberations.
Hmmmthis all slightly does my head inon one hand we have
typesthen type classes (which appear to be a relation defined on
types)then existential types...which now appear not to be treated
quite in
Hello Mark,
Thursday, January 10, 2008, 4:25:20 PM, you wrote:
instance Num a = A a
Mean the same thing as
instance A (forall a.Num a=a)
programmers going from OOP world always forget that classes in Haskell
doesn't the same as classes in C++. *implementation* of this instance
require to
class A a
type T = (forall x.Num x=x)
instance A T
type declares a synonym, like #define in C - but working only on
types.
So, essentially, you wrote
Yep that's fine..
instance A (forall x.Num x = x)
Yep
which is not very Haskelly.
Hmmm...
I am simply trying to
Sebastian Sylvan [EMAIL PROTECTED] wrote:
You make less bugs with that language? Fucking learn to write C++!
Excuse me?
A probable exclamation of a pointy-haired boss, that is. What I wanted
to say is that if you tell such a guy that you'll make less bugs in
language X, he would assume
Neil Mitchell wrote:
Laziness and purity together help with equational reasoning, compiler
transformations, less obscure bugs, better compositionality etc.
Although it could be argued that laziness is the cause of some very
obscure bugs... g
Niko
Achim Schneider [EMAIL PROTECTED] wrote:
The surest thing to make people switch is to make them not aware of
it, i.e. make things look exactly like in C, with incremental updates
of the same variable and everything, while still retaining a purely
functional semantic under the hood.
I guess
On Jan 10, 2008 1:25 PM, Nicholls, Mark [EMAIL PROTECTED] wrote:
Thanks for your response, I think you helped me on one of my previous
abberations.
Hmmmthis all slightly does my head inon one hand we have
typesthen type classes (which appear to be a relation defined on
-Original Message-
From: Bulat Ziganshin [mailto:[EMAIL PROTECTED]
Sent: 10 January 2008 13:36
To: Nicholls, Mark
Cc: Luke Palmer; haskell-cafe@haskell.org
Subject: Re[2]: [Haskell-cafe] confusion about 'instance'
Hello Mark,
Thursday, January 10, 2008, 4:25:20 PM, you
On Jan 10, 2008 2:04 PM, Nicholls, Mark [EMAIL PROTECTED] wrote:
I can translate OO into mathematical logic pretty easily, I was trying
to do the same thing (informally of course) with Haskellbut things
are not quite what they appearnot because of some OO hang up (which
I probably have
Niko Korhonen writes:
...
Although it could be argued that laziness is the cause of some very
obscure bugs... g
Niko
Example, PLEASE.
Jerzy Karczmarczuk
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Thanks for your response, I think you helped me on one of my
previous
abberations.
Hmmmthis all slightly does my head inon one hand we have
typesthen type classes (which appear to be a relation defined on
types)then existential types...which now appear not to be
treated
Nicholls, Mark wrote:
Thanks for your response, I think you helped me on one of my previous
abberations.
Hmmmthis all slightly does my head inon one hand we have
typesthen type classes (which appear to be a relation defined on
types)then existential types...which now appear not
On Jan 10, 2008 1:36 PM, Bulat Ziganshin [EMAIL PROTECTED] wrote:
Hello Mark,
Thursday, January 10, 2008, 4:25:20 PM, you wrote:
instance Num a = A a
Mean the same thing as
instance A (forall a.Num a=a)
programmers going from OOP world always forget that classes in Haskell
doesn't
Nicholls, Mark wrote:
My confusion is not between OO classes and Haskell classes, but exactly
are the members of a Haskell type class...I'd naively believed them to
be types (like it says on the packet!)...but now I'm not so sure.
Which packet?
Classes are not types.
Classes are groups of
Cetin Sert wrote:
I want to design a DSL in Haskell for propositional calculus. But
instead of using natural language names for functions like or, and,
implies etc. I want to use Unicode symbols as infix functions ¬, ˅, ˄,
→, ↔ But I keep getting error messages from the GHC parser. Is there a
On Jan 10, 2008 1:55 PM, Jules Bean [EMAIL PROTECTED] wrote:
Johan Tibell wrote:
Adding the following to my lighttpd config (on Ubuntu Feisty) solves
the problem from the server side:
external configuration files
## mimetype mapping
# change mime type for haskell source files
-Original Message-
From: Jules Bean [mailto:[EMAIL PROTECTED]
Sent: 10 January 2008 14:22
To: Nicholls, Mark
Cc: Bulat Ziganshin; haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] confusion about 'instance'
Nicholls, Mark wrote:
My confusion is not between OO classes
Someone said something about having 2 instances of the type in the
typeclass.maybe I misinterpreted it.
-Original Message-
From: Luke Palmer [mailto:[EMAIL PROTECTED]
Sent: 10 January 2008 14:12
To: Nicholls, Mark
Cc: Bulat Ziganshin; haskell-cafe@haskell.org
Subject: Re:
Hello list,
still playing with monads and states, I have the following question:
Given:
import Control.Monad.State.Lazy
data MyData = MyData { content :: String }
foobar :: State MyData String
foobar = do
gets content
Ok, that looks nice and tidy.
* Michael Roth wrote:
Exists there a way to write this cleaner without writing countless
set_xyz helper functions?
The syntactic sugar for record modifications is simply that: sugar.
You might write your own modifier functions:
set_bla x y = x { bla = y }
My problem is when viewing plain darcs repositories (like mine on
darcs.johantibell.com which I recently fixed with the above mime type
hack.)
Please complain to your browser('s authors): most browsers only provide
*one* way to view a given mime-type, which is stupid. It's not specific
to .hs
[EMAIL PROTECTED] wrote:
Niko Korhonen writes:
...
Although it could be argued that laziness is the cause of some very
obscure bugs... g
Niko
Example, PLEASE.
[1..] == [1..]
, for assumed operational semantics of ones own axiomatic semantics.
Bugs are only a misunderstanding
Nicholls, Mark wrote:
I only have 1 type.
If I say my name is mark twice, it doesn't mean I belong to set of
objects called Mark twice
Typeclasses define not only sets of types, but a common interface for
these types, too. An analogy would be to say:
I have a name, and it is Marc.
Stefan Monnier [EMAIL PROTECTED] wrote:
My problem is when viewing plain darcs repositories (like mine on
darcs.johantibell.com which I recently fixed with the above mime
type hack.)
Please complain to your browser('s authors): most browsers only
provide *one* way to view a given
On Jan 10, 2008 3:36 PM, Achim Schneider [EMAIL PROTECTED] wrote:
[EMAIL PROTECTED] wrote:
Niko Korhonen writes:
...
Although it could be argued that laziness is the cause of some very
obscure bugs... g
Niko
Example, PLEASE.
[1..] == [1..]
, for assumed operational
Daniel Yokomizo [EMAIL PROTECTED] wrote:
On Jan 10, 2008 3:36 PM, Achim Schneider [EMAIL PROTECTED] wrote:
[EMAIL PROTECTED] wrote:
Niko Korhonen writes:
...
Although it could be argued that laziness is the cause of some
very obscure bugs... g
Niko
Example, PLEASE.
On Thu, 10 Jan 2008, Nicholls, Mark wrote:
Existential:
newtype Numeric = forall a. Num a = Numeric a
My compiler doesn't like this A newtype constructor cannot have an
existential context,
Universal:
newtype Numeric' = Numeric' (forall a. Num a = a)
Not so sure I understand
Nicholls, Mark wrote:
Classes are groups of types. Sets of types. Classifications of types.
I had them down as an n-ary relation on typessomeone's said
something somewhere that's made me question that...but I think I
misinterpreted themso I may default back to n-ary relation.
Yes,
On Jan 9, 2008 5:42 PM, Henning Thielemann
[EMAIL PROTECTED] wrote:
I just want to point out that unsafePerformIO is at the core of the
(safe) bytestring library. As SPJ et al pointed out, this is crucial
functionality, and is only unsafe if unsafely used.
Indeed, there are hacks and they
Neil wrote:
Laziness. It is very difficult to have a lazy language which is not
pure.
Exactly.
Laziness and purity together help with equational reasoning, compiler
transformations, less obscure bugs, better compositionality etc.
Related, but nevertheless a shameless plug: Jurriaan Hage
Achim Schneider answers my question to somebody else (Niko Korhonen):
Although it could be argued that laziness is the cause of some very
obscure bugs... g
Niko
Example, PLEASE.
[1..] == [1..]
Whatever you may say more, this is neither obscure nor a bug. I still wait
for a relevant
First of all, thanks. My Aqua Emacs (on OS X Leopard) hangs when I
send a command like C-c C-l or C-c C-t to the interpreter (I can quit
the command using C-g) . Starting the interpreter and using :l from
inside it works fine. This is using GHC 6.8 (and I think I also tried
6.6.) What could
[EMAIL PROTECTED] wrote:
Although it could be argued that laziness is the cause of some very
obscure bugs... g Niko
Example, PLEASE.
Prelude sum [1..100]
*** Exception: stack overflow
Prelude Data.List.foldl' (+) 0 [1..100]
5050
Tillmann
[EMAIL PROTECTED] wrote:
Achim Schneider answers my question to somebody else (Niko Korhonen):
Although it could be argued that laziness is the cause of some
very obscure bugs... g
Niko
Example, PLEASE.
[1..] == [1..]
Whatever you may say more, this is neither
Hi Jonathan
On Wed, 2008-01-09 at 21:32 -0800, Jonathan Cast wrote:
An actual coding question, abuse? We should be so lucky.
:) Your comments are much appreciated.
This function is fairly complicated, simply because of the number of
separate definitions involved; I would be looking for
2008/1/10, Lutz Donnerhacke [EMAIL PROTECTED]:
* Michael Roth wrote:
Exists there a way to write this cleaner without writing countless
set_xyz helper functions?
The syntactic sugar for record modifications is simply that: sugar.
You might write your own modifier functions:
set_bla x y
rendel:
[EMAIL PROTECTED] wrote:
Although it could be argued that laziness is the cause of some very
obscure bugs... g Niko
Example, PLEASE.
Prelude sum [1..100]
*** Exception: stack overflow
Prelude Data.List.foldl' (+) 0 [1..100]
5050
See,
Achim Schneider:
jerzy.karczmarczuk asks what's wrong with:
[1..] == [1..]
Whatever you may say more, this is neither obscure nor a bug. I still
wait for a relevant example. But I don't insist too much...
It's not an example of a bug, but of a cause.
A cause of WHAT?? This is a
agl:
On Jan 9, 2008 5:01 PM, David Roundy [EMAIL PROTECTED] wrote:
But I can't imagine an implementation in which this change wouldn't slow
down getBytes for the normal case. Perhaps the slowdown would be small,
but it seems unwise to enforce that slowness at the API level, when we've
If I say my name is mark twice, it doesn't mean I belong to set of
objects called Mark twice
Yes, but instance declaration doesn't only state that some type
belongs to some class. It also provides some operations on this type.
___
Haskell-Cafe
On Jan 10, 2008 1:49 PM, Achim Schneider [EMAIL PROTECTED] wrote:
Sebastian Sylvan [EMAIL PROTECTED] wrote:
You make less bugs with that language? Fucking learn to write C++!
Excuse me?
A probable exclamation of a pointy-haired boss, that is. What I wanted
to say is that if you
Hello,
I am reading
http://hackage.haskell.org/trac/ghc/wiki/Commentary/Compiler/API. Is the GHC
API a means of reflection Haskell? Or to put more simply what is its intent?
Thanks, Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
vigalchin:
Hello,
I am reading
[1]http://hackage.haskell.org/trac/ghc/wiki/Commentary/Compiler/API. Is
the GHC API a means of reflection Haskell? Or to put more simply what is
its intent?
It can be used for reflection, since it exposes the interpreter at
Hello,
http://www.coverity.com/html/library.php *Ensuring Code Quality
in Multi-threaded Applications*
**
*This white paper touches on Haskell's STM but also issues that Sweeney
brought up in his slides(parallel programming in huge multi-cores and why
the current thread-based paradigm
Hi,
Is it possible not to load Prelude module
when compiling a Haskell module? Or instruct
ghc to “unload” it?
Thanks,
Maurício
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Jan 10, 2008, at 14:22 , Maurí cio wrote:
Is it possible not to load Prelude module
when compiling a Haskell module? Or instruct
ghc to “unload” it?
-fno-implicit-prelude
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] [EMAIL PROTECTED]
system administrator [openafs,heimdal,too
Sorry for the double message, Mauricio. It's the first time I ever
posted to haskell-cafe - figures I'd click on reply and not reply
to all...
On Jan 10, 2008 9:22 PM, Maurício [EMAIL PROTECTED] wrote:
Hi,
Is it possible not to load Prelude module
when compiling a Haskell module? Or instruct
Use:
import Prelude ()
On Jan 10, 2008 11:22 AM, Maurício [EMAIL PROTECTED] wrote:
Hi,
Is it possible not to load Prelude module
when compiling a Haskell module? Or instruct
ghc to unload it?
Thanks,
Maurício
___
Haskell-Cafe mailing list
At Thu, 10 Jan 2008 17:22:02 -0200,
Maurício wrote:
Hi,
Is it possible not to load Prelude module
when compiling a Haskell module? Or instruct
ghc to “unload” it?
You can either do:
import Prelude()
or compile with the -fno-implicit-prelude flag, or add
{-# LANGUAGE NoImplicitPrelude
David Roundy writes:
It's unfortunate that there's no way to include strictness
behavior in function types (at least that I'm aware of), so one has to rely
on possibly-undocumented (and certainly never checked by a compiler)
strictness behavior of many functions in order to write truly correct
Sebastian Sylvan [EMAIL PROTECTED] wrote:
Concurrency
does seem pretty disruptive.
Yes, the thought of using par on a dual quad-core makes me salivate.
--
(c) this sig last receiving data processing entity. Inspect headers for
past copyright information. All rights reserved. Unauthorised
barsoap:
Sebastian Sylvan [EMAIL PROTECTED] wrote:
Concurrency
does seem pretty disruptive.
Yes, the thought of using par on a dual quad-core makes me salivate.
Haskell is (in a very small part) driving sales of multicore boxes --
I've met half a dozen people who nominated Haskell's
On Thu, 10 Jan 2008, David Roundy wrote:
On Jan 9, 2008 5:42 PM, Henning Thielemann
In Modula-3 modules using hacks must be explicitly marked as UNSAFE. See
http://www.cs.purdue.edu/homes/hosking/m3/reference/unsafe.html
Maybe this is also an option for Haskell?
I don't think this
Don Stewart [EMAIL PROTECTED] wrote:
In return, we can improve the parallelism support further.
Now don't make me think of using par on a beowolf cluster of ps3's.
--
(c) this sig last receiving data processing entity. Inspect headers for
past copyright information. All rights reserved.
On Thu, Jan 10, 2008 at 10:10:21AM -0800, Don Stewart wrote:
rendel:
[EMAIL PROTECTED] wrote:
Although it could be argued that laziness is the cause of some very
obscure bugs... g Niko
Example, PLEASE.
Prelude sum [1..100]
*** Exception: stack overflow
Prelude
[EMAIL PROTECTED] wrote:
Achim Schneider:
jerzy.karczmarczuk asks what's wrong with:
[1..] == [1..]
Whatever you may say more, this is neither obscure nor a bug. I
still wait for a relevant example. But I don't insist too much...
It's not an example of a bug, but of a
David Roundy [EMAIL PROTECTED] writes:
I just want to point out that unsafePerformIO is at the core of the
(safe) bytestring library. As SPJ et al pointed out, this is crucial
functionality, and is only unsafe if unsafely used.
In Modula-3 modules using hacks must be explicitly marked as
On Jan 10, 2008 8:06 PM, Ketil Malde [EMAIL PROTECTED] wrote:
David Roundy [EMAIL PROTECTED] writes:
I just want to point out that unsafePerformIO is at the core of the
(safe) bytestring library. As SPJ et al pointed out, this is crucial
functionality, and is only unsafe if unsafely
On Thu, Jan 10, 2008 at 08:10:57PM +, Sebastian Sylvan wrote:
On Jan 10, 2008 8:06 PM, Ketil Malde [EMAIL PROTECTED] wrote:
David Roundy [EMAIL PROTECTED] writes:
I just want to point out that unsafePerformIO is at the core of the
(safe) bytestring library. As SPJ et al pointed
On Thu, Jan 10, 2008 at 11:17:18AM +0200, Yitzchak Gale wrote:
The special case of 1/0 is less clear, though. One might
decide that it should be an error rather than NaN, as some
languages have.
It is neither,
1/0 = Infinity
-1/0 = -Infinity
At least on IEEE style floating point systems.
On Thu, Jan 10, 2008 at 10:07:25AM -0500, Stefan Monnier wrote:
My problem is when viewing plain darcs repositories (like mine on
darcs.johantibell.com which I recently fixed with the above mime type
hack.)
Please complain to your browser('s authors): most browsers only provide
*one* way
John Meacham [EMAIL PROTECTED] wrote:
On Thu, Jan 10, 2008 at 11:17:18AM +0200, Yitzchak Gale wrote:
The special case of 1/0 is less clear, though. One might
decide that it should be an error rather than NaN, as some
languages have.
It is neither,
1/0 = Infinity
-1/0 = -Infinity
On Jan 10, 2008 8:12 PM, David Roundy [EMAIL PROTECTED] wrote:
On Thu, Jan 10, 2008 at 08:10:57PM +, Sebastian Sylvan wrote:
On Jan 10, 2008 8:06 PM, Ketil Malde [EMAIL PROTECTED] wrote:
David Roundy [EMAIL PROTECTED] writes:
I just want to point out that unsafePerformIO is at
On Thu, Jan 10, 2008 at 09:24:34PM +0100, Achim Schneider wrote:
John Meacham [EMAIL PROTECTED] wrote:
On Thu, Jan 10, 2008 at 11:17:18AM +0200, Yitzchak Gale wrote:
The special case of 1/0 is less clear, though. One might
decide that it should be an error rather than NaN, as some
Sebastian Sylvan [EMAIL PROTECTED] writes:
Maybe I'm just lucky, but if we are still talking about the games
industry I don't think this fits my experience of bosses. Games
compete very much on performance, and we basically rewrite almost all
of our code over a few years or so anyway
Another
Ketil Malde [EMAIL PROTECTED] wrote:
Sebastian Sylvan [EMAIL PROTECTED] writes:
Maybe I'm just lucky, but if we are still talking about the games
industry I don't think this fits my experience of bosses. Games
compete very much on performance, and we basically rewrite almost
all of our
David Roundy [EMAIL PROTECTED] wrote:
On Thu, Jan 10, 2008 at 09:24:34PM +0100, Achim Schneider wrote:
John Meacham [EMAIL PROTECTED] wrote:
On Thu, Jan 10, 2008 at 11:17:18AM +0200, Yitzchak Gale wrote:
The special case of 1/0 is less clear, though. One might
decide that it should
On Thu, Jan 10, 2008 at 09:41:53PM +0100, Achim Schneider wrote:
David Roundy [EMAIL PROTECTED] wrote:
On Thu, Jan 10, 2008 at 09:24:34PM +0100, Achim Schneider wrote:
John Meacham [EMAIL PROTECTED] wrote:
1/0 = Infinity
-1/0 = -Infinity
Just out of curiosity:
1/-0 =
David Roundy [EMAIL PROTECTED] wrote:
On Thu, Jan 10, 2008 at 09:41:53PM +0100, Achim Schneider wrote:
David Roundy [EMAIL PROTECTED] wrote:
On Thu, Jan 10, 2008 at 09:24:34PM +0100, Achim Schneider wrote:
John Meacham [EMAIL PROTECTED] wrote:
1/0 = Infinity
-1/0 = -Infinity
On Wed, 9 Jan 2008, apfelmus wrote:
So, difference lists are no eierlegende wollmilchsau either.
LEO's forum suggests 'swiss army knife' as translation. :-)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Henning Thielemann [EMAIL PROTECTED] wrote:
On Wed, 9 Jan 2008, apfelmus wrote:
So, difference lists are no eierlegende wollmilchsau either.
LEO's forum suggests 'swiss army knife' as translation. :-)
But you really need one with 5 differently-sized blades plus three
spezialized
Achim Schneider wrote:
Henning Thielemann wrote:
apfelmus wrote:
So, difference lists are no eierlegende wollmilchsau either.
LEO's forum suggests 'swiss army knife' as translation. :-)
But you really need one with 5 differently-sized blades plus three
spezialized carving blades, an USB
1 - 100 of 133 matches
Mail list logo
