Malcolm Wallace wrote:
Andrew Coppin [EMAIL PROTECTED] wrote:
instnace Show (Foo Int) ...
instnace Show (Foo Double) ...
...WHY did I not think of this myself? o_O
Because it is not Haskell'98?
It requires {-# LANGUAGE OverlappingInstances #-}
No it doesn't?
It requires the much
On 15 Aug 2008, at 12:17 pm, Brandon S. Allbery KF8NH wrote:
Actually, while I'm not sure how Linux does it, on the *BSDs pipes
are actually socketpairs.
This raises the question, which the documentation did not make clear
to me,
whether a named pipe is a pipe. One would hope it was, but
I am working on a system to induce recursive functional programs from
examples, e.g. 'learn' the reverse function from
rev [] = []
rev [a] = [a]
rev [a,b] = [b,a]
rev [a,b,c] = [c,b,a]
...
Although I use analytical
On 2008 Aug 15, at 2:23, Richard A. O'Keefe wrote:
On 15 Aug 2008, at 12:17 pm, Brandon S. Allbery KF8NH wrote:
Actually, while I'm not sure how Linux does it, on the *BSDs pipes
are actually socketpairs.
This raises the question, which the documentation did not make clear
to me,
whether
On Fri, 15 Aug 2008, Jules Bean wrote:
Malcolm Wallace wrote:
Andrew Coppin [EMAIL PROTECTED] wrote:
instnace Show (Foo Int) ...
instnace Show (Foo Double) ...
...WHY did I not think of this myself? o_O
Because it is not Haskell'98? It requires {-# LANGUAGE
OverlappingInstances #-}
Hello all,
Is there any plan to make a package for archlinux x86_64 with (more or
less) complete GHC 6.8.3 binaries? I know I can download and install
myself, usually I do so myself, but the reason is to prepare a list of
packages for others. So far, the 6.8.2 is available.
Is there any
On 8/15/08, Dusan Kolar [EMAIL PROTECTED] wrote:
Hello all,
Is there any plan to make a package for archlinux x86_64 with (more or
less) complete GHC 6.8.3 binaries? I know I can download and install myself,
usually I do so myself, but the reason is to prepare a list of packages for
Is there any plan to make a package for archlinux x86_64 with (more or
less) complete GHC 6.8.3 binaries? I know I can download and install myself,
usually I do so myself, but the reason is to prepare a list of packages for
others. So far, the 6.8.2 is available.
Hi, Arch ghc
On Thu, 14 Aug 2008 14:17:05 -0700, Don Stewart [EMAIL PROTECTED]
wrote:
[...]
Skills:
Proficiency and a strong interest in Haskell programming :)
Bachelor's degree in computer science or equivalent from a four-year
institution.
This is the required background of Haskell-related
Henning Thielemann wrote:
instance on Foo a?
Btw. was anything bad about the suggested Haskell98 solution?
You called it 'non-hacky'; I would call it 'slightly hacky' since, IMO,
it qualifies as a hack around a deficiency in the class system.
However, I don't think there is anything wrong
Hi there,
I'm writing a pretty printer using the Text.PrettyPrint library, and there's a
pattern I'm coming across quite often. Does anyone know whether,
text (a ++ b ++ c ++ d)
or
text a + text b + text c + text d
runs quicker?
Cheers,
Paul
___
Paul,
Something tells me you might want to look at `concat':
concat :: [[a]] - [a]
/jve
2008/8/15 Paul Keir [EMAIL PROTECTED]
Hi there,
I'm writing a pretty printer using the Text.PrettyPrint library, and
there's a pattern I'm coming across quite often. Does anyone know whether,
text
On Thu, 14 Aug 2008, Brandon S. Allbery KF8NH wrote:
Actually, while I'm not sure how Linux does it, on the *BSDs pipes are
actually socketpairs.
Not any more. FreeBSD replaced the socketpair implementation with a faster
one in 1996 and OpenBSD imported it soon after. NetBSD imported it in
Thanks,
So you're recommending:
text (concat [a,b,c,d,e])
Might this not transform my pretty printing into ugly printing; when longer
strings are used?
Paul
-Original Message-
From: [EMAIL PROTECTED] on behalf of John Van Enk
Sent: Fri 15/08/2008 14:31
To: Paul Keir
Cc:
Paul Keir wrote:
Hi there,
I'm writing a pretty printer using the Text.PrettyPrint library, and
there's a pattern I'm coming across quite often. Does anyone know whether,
text (a ++ b ++ c ++ d)
or
text a + text b + text c + text d
runs quicker?
Don't worry about speed. Write it as:
Paul Keir schrieb:
Hi there,
I'm writing a pretty printer using the Text.PrettyPrint library, and
there's a pattern I'm coming across quite often. Does anyone know
whether,
text (a ++ b ++ c ++ d)
or
text a + text b + text c + text d
runs quicker?
Hi Paul,
text (a ++ b ++ c ++ d)
Paul Keir [EMAIL PROTECTED] wrote:
text (a ++ b ++ c ++ d)
The above is going to be ugly-printed onto a single line, whilst this:
text a + text b + text c + text d
has a chance to be pretty-printed onto several lines, if each component
is individually long.
It doesn't really matter which
Paul,
I'm sorry, I ignored the PrettyPrint part and latched onto the faster
part. You definitely don't want concat. I was looking at run-time. :)
/jve
On Fri, Aug 15, 2008 at 9:35 AM, Paul Keir [EMAIL PROTECTED] wrote:
Thanks,
So you're recommending:
text (concat [a,b,c,d,e])
Might
Awesome! Thanks to you all. I'll start with
hsep[map a, b, c, d]
and then I can try changing hsep for other things.
Paul
-Original Message-
From: Benedikt Huber [mailto:[EMAIL PROTECTED]
Sent: Fri 15/08/2008 14:53
To: Paul Keir
Cc: haskell-cafe@haskell.org
Subject: Re: Pretty Print,
Sorry, I meant runhaskell Setup.hs configure|build. To clarify, I DO
have a Setup.hs, and am getting the error in my original post when
running it.
On Fri, Aug 15, 2008 at 1:42 AM, Ketil Malde [EMAIL PROTECTED] wrote:
Nicholas Andrews [EMAIL PROTECTED] writes:
$ runhaskell blah.cabal configure
On 2008 Aug 15, at 9:34, Tony Finch wrote:
On Thu, 14 Aug 2008, Brandon S. Allbery KF8NH wrote:
Actually, while I'm not sure how Linux does it, on the *BSDs pipes
are
actually socketpairs.
Not any more. FreeBSD replaced the socketpair implementation with a
faster
one in 1996 and
Henning Thielemann wrote:
On Thu, 14 Aug 2008, Henning Thielemann wrote:
On Wed, 13 Aug 2008, Andrew Coppin wrote:
The naming of cats is a difficult matter...
Ahem. So as you may have noticed, we seem to have a profusion of
packages all called binary or something dangeriously similar.
On Fri, Aug 15, 2008 at 2:37 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
Now both packages can be installed at once, but when I say import
Data.Hashtable, GHC has no way to know which one I mean. That doesn't sound
too clever to me...
GHC can hide packages or, put it another way, can show only
DekuDekuplex:
On Thu, 14 Aug 2008 14:17:05 -0700, Don Stewart [EMAIL PROTECTED]
wrote:
[...]
Skills:
Proficiency and a strong interest in Haskell programming :)
Bachelor's degree in computer science or equivalent from a four-year
institution.
This is the required
Andrew Coppin wrote:
Now both packages can be installed at once, but when I say import
Data.Hashtable, GHC has no way to know which one I mean. That doesn't
sound
too clever to me...
I agree, Andrew. The hierarchical module approach depends on a global
resource for allocating names (or
Whoops. Forgot to hit reply all.
On Wed, Aug 13, 2008 at 4:58 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
The naming of cats is a difficult matter...
Ahem. So as you may have noticed, we seem to have a profusion of packages
all called binary or something dangeriously similar. There's also
Sean Leather wrote:
That doesn't work if you want to use two packages that have modules
sharing the same hierarchical name, and this is a definite possibility
given my statements above. Of course, having the ability to import
modules from specific packages [1] would fix this, but only as long
-- Announcing: logfloat 0.8.2
I just released a new package, logfloat, for manipulating log-domain
floating numbers.
The main reason for casting numbers into the log-domain is to prevent
underflow when
wren:
-- Announcing: logfloat 0.8.2
I just released a new package, logfloat, for manipulating log-domain
floating numbers.
Arch Linux package now ready,
wren ng thornton wrote:
-- Announcing: logfloat 0.8.2
[...]
The code is very heavily documented, largely for pedagogical reasons.
Since Haddock doesn't play very nicely with literate Haskell, there's
I should point out just in case that 1 / 0 isn't infinity on all
Fractional types (e.g. Rational). I guess it shouldn't cause a problem
with your library, but a warning on the Haddock entry would be nice to
avoid surprising people who didn't see the internal implementation.
Nice lib, by the way.
Felipe Lessa wrote:
I should point out just in case that 1 / 0 isn't infinity on all
Fractional types (e.g. Rational). I guess it shouldn't cause a problem
with your library, but a warning on the Haddock entry would be nice to
avoid surprising people who didn't see the internal implementation.
On Fri, Aug 15, 2008 at 7:24 PM, wren ng thornton [EMAIL PROTECTED] wrote:
(( For readers who don't want to slog through the rest of this post, the
conclusion is that I feel an agile packaging system is an imperative, as
discussed above. The trick is finding a way to be agile without creating a
--- On Sat, 8/16/08, wren ng thornton [EMAIL PROTECTED] wrote:
Personally, I have major qualms with the Java package
naming scheme. In
particular, using domain names sets the barrier to entry
much too high
for casual developers (e.g. most of the Haskell user base).
Yes, DNs are
cheap and
David Menendez wrote:
On Fri, Aug 15, 2008 at 7:24 PM, wren ng thornton [EMAIL PROTECTED] wrote:
(( For readers who don't want to slog through the rest of this post, the
conclusion is that I feel an agile packaging system is an imperative, as
discussed above. The trick is finding a way to be
On Fri, 15 Aug 2008, Andrew Coppin wrote:
Henning Thielemann wrote:
http://www.haskell.org/haskellwiki/Hierarchical_module_names
Right. So if for some reason two people both developed a hashtable
implementation (say), we would end up with two modules both called
Data.Hashtable, but
36 matches
Mail list logo
