G'day all.
On Sat, Jul 05, 2003 at 11:44:54PM -0400, Dimitry Golubovsky wrote:
What would be really nice to have is some sort of object input/output
over network. Then, by sending a String, I would expect it to be
recreated at the other end. And if the other end expects, say [Int] then
an
G'day all.
On Tue, Nov 12, 2002 at 05:25:42PM +, Alastair Reid wrote:
So as people try to come up with a distribution and build mechanism
that will work for GHC, it would be good to think about how that
same mechanism would work for Hugs too.
If you will allow me to AOL...
Me too!
G'day all.
On Wed, Oct 16, 2002 at 07:54:17AM -0700, Hal Daume III wrote:
I was reading the HFL libs, namely Control.Monad.Logic, and there's a
definition in there:
newtype Logic a = Logic { mkLogic :: (forall b. (a - b - b) - b - b) }
I'm curious why this is legal, but
newtype
G'day all.
On Mon, Jul 01, 2002 at 09:04:37AM +0200, Ketil Z. Malde wrote:
I was going to run through the statistics to work out the expected
running time for a quick sort (i.e. sorting random data);
Few programs routinely run on random data.
Cheers,
Andrew Bromage
G'day all.
On Fri, Jun 28, 2002 at 09:44:11AM +0200, Ketil Z. Malde wrote:
I, for one, am sorting expected, not worst-case, data :-)
gripe
What's this obsession with worst-case behaviour anyway?
The best algorithm to use is the one which exploits known facts about
the data. The converse
G'day all.
Why is it GHC 5.02.2, 5.03 etc.? Wouldn't it be easier
with 5.2.2, 5.3?
On Mon, May 06, 2002 at 11:44:03AM +0100, Simon Marlow wrote:
I don't know, probably historical reasons: as far as I can remember,
GHC's version numbers always had two digits after the decimal point.
At
G'day all.
On Fri, Oct 19, 2001 at 02:30:59PM +0100, Ian Lynagh wrote:
Also, the prelude definition of zipWith has LVL whereas the following
definition has LVV. Why is something like the following not used?
zipWith :: (a-b-c) - [a] - [b] - [c]
zipWith f (a:as) (b:bs) = f
G'day all.
On Fri, Oct 05, 2001 at 06:17:26PM +, Marcin 'Qrczak' Kowalczyk wrote:
This information is out of date. AFAIR about 4 of them is assigned.
Most for Chinese (current, not historic).
I wasn't aware of this. Last time I looked was Unicode 3.0. Thanks
for the update.
In
G'day all.
On Fri, Oct 05, 2001 at 02:29:51AM -0700, Krasimir Angelov wrote:
Why Char is 32 bit. UniCode characters is 16 bit.
It's not quite as simple as that. There is a set of one million
(more correctly, 1M) Unicode characters which are only accessible
using surrogate pairs (i.e. two
G'day all.
On Mon, Jul 30, 2001 at 06:06:07AM -0700, Julian Seward (Intl Vendor) wrote:
After some discussion in the GHC office, we're unsure about why
you need to compile Main.c with a C++ compiler for this to work.
Under g++ you may not strictly need it. I'm not sure about that.
However,
G'day all.
On Sat, Jul 21, 2001 at 01:32:43AM +0800, Corneliu Popeea wrote:
I'm trying to use from Haskell a C++ library (Omega Calculator).
I'm using the following command:
ghc -c -fglasgow-exts -package lang main.hs
ghc main.o mylib.o -lomega -lstdc++ -fglasgow-exts -package lang
Do
G'day all.
On Thu, May 10, 2001 at 09:24:36PM +, Marcin 'Qrczak' Kowalczyk wrote:
BTW, another question: should MonadPlus instead of just Monad be
a superclass of MonadError? It has a natural definition in terms
of catchError.
I can see how mplus has a natural definition (I can think of
G'day all.
Mon, 9 Apr 2001 11:52:47 +0200, Pasch, Thomas (ACTGRO)
[EMAIL PROTECTED] pisze:
For example:
'function f' gives the String "a-a"
On Sat, Apr 14, 2001 at 08:28:16PM +, Marcin 'Qrczak' Kowalczyk wrote:
[...]
In this form it's not even theoretically consistent: any
13 matches
Mail list logo
