Derek Elkins wrote:
While perhaps for a simple throw-away program it may be beneficial to
write code that allocates unnecessary stack, I personally consider
unnecessary stack use a bug. A stack overflow, to me, is always
indicative of a bug.
The bug is in ghc stack management. Why is it so
Hi Uwe,
BTW: I've taken the tagsoup lib and wrote
a small parser to build a tree out of the stream
of tags. It's about a 100 lines of code.
This DOM parser does not need to read until
the closing tag to build an element node,
so it should be as lasy as possible.
A first version for HTML
On 29/01/2008, Henning Thielemann [EMAIL PROTECTED] wrote:
Thanks for the clarification! I added it to
http://www.haskell.org/haskellwiki/Haskell.org_domain
Can you insert the link to the web-submission system?
I've done this.
I also tried to request an account on code.haskell.org, but
On Tue, 2008-01-29 at 06:15 +, Tim Docker wrote:
stevelihn wrote:
In my brief experience with Ocaml's GODI, GODI has a way to specify
them in a so-called config package. The install package then reads
what it needs from the config package. In perl's CPAN shell, you can
specify them
Rene de Visser wrote:
If I remember correctly, the data type of the tree in HXT is something like
data Tree = Tree NodeData [Tree]
which means that already processed parts of the tree can't be garbage
collected because the parent node is holding onto them.
This statement only holds, if
Tim Chevalier(*) writes:
I think to ease the acceptance of Haskell in the broader world, we
should just change the name to Schönfinkel.
On the other hand, is better not to try Curry, since the French pronounce
it: Queue-rhrhrh. This is for me absolutely inacceptable and scandalous,
since
Hi Adrian,
The bug is in ghc stack management. Why is it so important that the
stack size is arbitrarily limited?
It's not, but it makes some things easier and faster. A better
question is why is it important for the stack to grow dynamically. The
answer is that its not.
It's just an
On 1/29/08, [EMAIL PROTECTED]
[EMAIL PROTECTED] wrote:
On the other hand, is better not to try Curry, since the French pronounce
it: Queue-rhrhrh. This is for me absolutely inacceptable and scandalous,
since thus, they confuse him with Madame Curie, who was Polish, and I am
a patriot. And
Hello Haskell-Cafe!
I've read about Control.Parallel and wanted to give it a try. Here's
what I wrote:
---
import Control.Parallel
import Data.List
splitList :: [Integer] - [[Integer]]
splitList = unfoldr f where
f [] = Nothing
f ~x = Just (splitAt 3 x)
map' :: (a-b) -
Hi Neil,
Please send a patch with whatever come up with, so others can make use
of it. I've already added Data.HTML.TagSoup.Tree to the latest darcs
version, which does as well as it can with tag matching, but is
entirely strict. Having a lazy version would be great.
It's too early for a new
Hello,
I am using the very simple interactTCP example from [1] to play around with
Haskell network programming but I just can't get a simple client for that
example to work (it works like a charm with my telnet client, as described in
the article).
This is what I am trying to do with the
[EMAIL PROTECTED] writes:
Jerzy Karczmarczuk (pronounced as written)
Do you mean you don't care, or are you assuming that we know
whether the convention is to read it as Polish orthography,
English, or French?
Jón (invariably mispronounced)
--
Jón Fairbairn
Hi
Timo B. Hübel wrote:
Hello,
I am using the very simple interactTCP example from [1] to play around with
Haskell network programming but I just can't get a simple client for that
example to work (it works like a charm with my telnet client, as described in
the article).
This is
On Tuesday 29 January 2008 14:44:42 Mads Lindstrøm wrote:
If you replace the `putStrLn (show res)` with this:
mapM_ (\x - putStr (show x) hFlush stdout) res
it works.
Hm, unfortunately not for me (Linux, GHC 6.8.2) ...
I _think_ the problem is that `putStrLn (show res)` will wait until
On 29 Jan 2008, at 1:28 AM, Neil Mitchell wrote:
Hi Adrian,
The bug is in ghc stack management. Why is it so important that the
stack size is arbitrarily limited?
It's not, but it makes some things easier and faster. A better
question is why is it important for the stack to grow
On 1/29/08, PR Stanley [EMAIL PROTECTED] wrote:
I didn't know Haskell was an English name.
Haskell Curry was an American, and I think the usual convention is to
pronounce names in the manner of the language that the person who has
the name speaks. (Preferably just to pronounce people's names the
At 16:16 29/01/2008, you wrote:
Am Dienstag, 29. Januar 2008 02:25 schrieb Tim Chevalier:
On 1/28/08, [EMAIL PROTECTED]
[EMAIL PROTECTED] wrote:
Well, unless you are French. Then you don't pronounce H. The remaining
letters are pronounced according to the Règlements de l'Académie.
Am Dienstag, 29. Januar 2008 02:25 schrieb Tim Chevalier:
On 1/28/08, [EMAIL PROTECTED]
[EMAIL PROTECTED] wrote:
Well, unless you are French. Then you don't pronounce H. The remaining
letters are pronounced according to the Règlements de l'Académie.
Fair enough. I wouldn't want to be
This computes 100!. This version takes 8m29.189s to execute.
Replace foldr1 with foldr and that goes down to 7m4.315s. Replace
product' with the Prelude product and it takes only 6m17.685s. Why is
that so? I'm using ghc 6.8.1 on Mac OS X.
I'm guessing that the speedup with the Prelude
Version 1.1.4.0 of the HDBC-odbc package crashes GHCi when I issue:
Prelude :m +Database.HDBC.ODBC
Prelude Database.HDBC.ODBC connectODBC
I'm using Cygwin and GHC-6.8.2 on a Windows XP machine. Furthermore,
using connectODBC with a valid connection string also results in GHCi
crashing (using
On Jan 29, 2008 1:45 PM, Yitzchak Gale [EMAIL PROTECTED] wrote:
Paul Hudak wrote:
Well, Haskell was Curry's first name, so perhaps we should use Moses,
which was Schönfinkel's first name, and has some nice biblical metaphors
:-)
Haskell is fine for that. In Biblical Hebrew, it means
Paul Hudak wrote:
Well, Haskell was Curry's first name, so perhaps we should use Moses,
which was Schönfinkel's first name, and has some nice biblical metaphors
:-)
Haskell is fine for that. In Biblical Hebrew, it means enlightenment
or insight.
-Yitz
Well, Haskell was Curry's first name, so perhaps we
should use "Moses",
which was Schönfinkel's first name, and has some nice biblical
metaphors :-)
-Paul
[EMAIL PROTECTED] wrote:
Tim
Chevalier(*) writes:
I think to ease the acceptance of Haskell in
the broader world, we
should
Alistair Bayley wrote:
...the right thing to put into the form... where can I find it?
Load your PPK file in PuTTYgen. Copy the entire contents of
the Public key for pasting into OpenSSH authorized_keys file
text box onto the clipboard, and paste it into the form on the
web site.
Hope this
On 2008-01-29, Alistair Bayley [EMAIL PROTECTED] wrote:
On 29/01/2008, Henning Thielemann [EMAIL PROTECTED] wrote:
Thanks for the clarification! I added it to
http://www.haskell.org/haskellwiki/Haskell.org_domain
Can you insert the link to the web-submission system?
I've done this.
I
Jerzy, keep posting, I'm enjoying this magic cultural trip. : )
Obrigado,
Paulo Tanimoto (pronounce it as you please)
On Jan 29, 2008 10:13 AM, [EMAIL PROTECTED] wrote:
Tim Chevalier writes:
... I think the usual convention is to
pronounce names in the manner of the language that the
[EMAIL PROTECTED] wrote:
Tim Chevalier writes:
... I think the usual convention is to
pronounce names in the manner of the language that the person who has
the name speaks. (Preferably just to pronounce people's names the way
they say them.)
(The first convention doesn't work with my last name,
On 1/29/08, [EMAIL PROTECTED]
[EMAIL PROTECTED] wrote:
Oh, people!
I try hard to degenerate this discussion into a pure delirium traemens, and
you still keep its serious intellectual contents intact! I bet that you
don't even smile, writing your terrible off-topic postings!
Damn, I was trying
On Tuesday 29 January 2008 17:12:19 you wrote:
There was a similar bug in lazy bytestring's hGetContents a while back
which involve it waiting for a whole chunk and not returning short
reads, but from watching the strace of this code, GHC is reading
byte-by-byte (which is actually pretty dumb,
On Jan 29, 2008 6:28 AM, Timo B. Hübel [EMAIL PROTECTED] wrote:
Hm, unfortunately not for me (Linux, GHC 6.8.2) ...
That's odd, because it works for me on the exact same setup.
There was a similar bug in lazy bytestring's hGetContents a while back
which involve it waiting for a whole chunk and
Hello,
I had a question about type classes and data types. I want to create one
class that has a function which depends upon a parameter from another
class. I would assume that this can be done, but I can't seem to write
code that does it. Can anybody tell me what is wrong? Here is an example
Hello Chaim,
Tuesday, January 29, 2008, 7:26:25 PM, you wrote:
your approach is completely wrong (OOP-inspired, but haskell isn't OOP
language). type class is common interface to different types. just for
example:
data BinState = On | Off
data BinChange = OnToOff | OffToOn
class MinValue a
I didn't know Haskell was an English name.
There's a Haskell playing for England at Twickenham on Saturday.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Tim Chevalier writes:
... I think the usual convention is to
pronounce names in the manner of the language that the person who has
the name speaks. (Preferably just to pronounce people's names the way
they say them.)
(The first convention doesn't work with my last name, though the
second one
On 30/01/2008, [EMAIL PROTECTED]
[EMAIL PROTECTED] wrote:
PS. If you think that arigato is a genuine Japanese word, well, check
how the appropriately translated word is spelled in Portuguese...
Another Japanese word adopted from Portuguese is their word for bread: pan.
Jeremy
On Jan 29, 2008 11:19 AM, Jeremy Apthorp [EMAIL PROTECTED] wrote:
Another Japanese word adopted from Portuguese is their word for bread:
pan.
tabako too, I believe (it's not even written in katakana).
Now, how do the Japanese pronounce Haskell, I'd like to know.
Paulo
On Tue, Jan 29, 2008 at 07:38:24PM +, Neil Mitchell wrote:
A lot also depends on compiler (and associated rts), such as whether
or not it translates to CPS, thereby in effect building a stack (in
all but name) on the heap.
If you burn a lot of heap, for not much gain, that's still a
Jonathan Cast wrote:
http://www.cs.princeton.edu/~appel/papers/45.ps is the traditional cite
here, no?
Can be is not the same as is. A lot depends on exactly what you
call a stack and the relative efficiencies of stack vs. heap
implementations. Certainly my experience of library tuning tells
ndmitchell:
Hi
implementations. Certainly my experience of library tuning tells
me that (with ghc at least), designing your code and data structures
to keep heap allocation down to an absolute minimum is very important.
Yes. Keeping allocation low is very important, be it heap or
On 29 Jan 2008, at 20:21, Anton van Straaten wrote:
Froprakxculmizum troodulifnax!
Bless you!
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi
implementations. Certainly my experience of library tuning tells
me that (with ghc at least), designing your code and data structures
to keep heap allocation down to an absolute minimum is very important.
Yes. Keeping allocation low is very important, be it heap or stack.
Heap allocation
On Tue, Jan 29, 2008 at 09:28:56AM +, Neil Mitchell wrote:
Hi Adrian,
The bug is in ghc stack management. Why is it so important that the
stack size is arbitrarily limited?
It's not, but it makes some things easier and faster. A better
question is why is it important for the stack
Neil Mitchell wrote:
My claim is that any program which needs to adjust the stack size has
a laziness leak - since I've made a universally quantified claim, a
couple of real examples should blow it out of the water.
But people often deliberately introduce lazyness leaks for improved
efficency
[EMAIL PROTECTED] wrote in article [EMAIL PROTECTED] in
gmane.comp.lang.haskell.cafe:
Arigato gozaimasu.
Jerzy Karczmarczuk.
PS. If you think that arigato is a genuine Japanese word, well, check
how the appropriately translated word is spelled in Portuguese...
I'm not sure what you
Hi,
My application has to manage a data set. I assume the state monad is
designed for this.
The state changes in functions that:
a. perform IO actions and
b. return execution status and execution trace (right now I'm using
WriteT for this).
Is the best solution:
1. to build a monad stack
On 29 Jan 2008, at 9:44 PM, Adam Smyczek wrote:
Hi,
My application has to manage a data set. I assume the state monad
is designed for this.
The state changes in functions that:
a. perform IO actions and
b. return execution status and execution trace (right now I'm using
WriteT for this).
On Tue, 2008-01-29 at 08:18 +, Adrian Hey wrote:
Derek Elkins wrote:
While perhaps for a simple throw-away program it may be beneficial to
write code that allocates unnecessary stack, I personally consider
unnecessary stack use a bug. A stack overflow, to me, is always
indicative of
It works like a charm,
thanks a lot Jonathan!
Adam
On Jan 29, 2008, at 10:26 PM, Jonathan Cast wrote:
On 29 Jan 2008, at 9:44 PM, Adam Smyczek wrote:
Hi,
My application has to manage a data set. I assume the state monad
is designed for this.
The state changes in functions that:
a.
48 matches
Mail list logo
