Chris Kuklewicz wrote:
Greg Buchholz wrote:
True. But there are some tests like fasta that appear to have a
laziness induced space leak that presumably could be fixed.
http://shootout.alioth.debian.org/benchmark.php?test=fastalang=all
Already the following bit exhibits unexpected
Another GADT `bug report': type synonyms are not unfolded
when checking the signature of the data constructors: given
type Hello a = a - a
data World :: * where
Msg :: Hello World
GHC reports
GADT.lhs:2:1:
Data constructor `Msg' returns type `Hello'
instead of its parent type
On Tue, Dec 27, 2005 at 08:12:20PM +0100, Christian Maeder wrote:
Already the following bit exhibits unexpected memory consumption:
main = mapM_ print $ take (n * 5) $ drop (n * 3) [1..]
n = 10
Dropping the elements is more expensive than printing them. Somehow the
dropped elements
Dimitry Golubovsky wrote:
2. Error while assembling (or mangling?) ForeignObj.lhs; fragments of
make output below (long lines wrapped/truncated, the whole file is too
long to post it here but I'll provide it if needed):
Could it be that sed chops of some lines and perl should be used
Am Freitag, 16. Dezember 2005 12:20 schrieb Malcolm Wallace:
I've been looking at the cvs configuration file CVSROOT/modules.
I /think/ the procedure is something like changing this:
nhc98src-d nhc98 nhc98
nhc98libraries -d nhc98/src/libraries fptools/libraries
Bulat Ziganshin wrote:
Hello all
why the folowing is not allowed even with all extensions enabled both
in Hugs and GHC?
class BufStream h where
class CharStream h where
instance (CharStream h) = BufStream h where
class MemoryStream h where
instance (MemoryStream h) = BufStream h where
Try
On 2005-12-23, Malcolm Wallace [EMAIL PROTECTED] wrote:
Is there more to this job than just running either cvs2darcs or tailor,
then waiting a few days (:-) for it to finish?
There is quite some time involved in bootstrapping things, especially
when branches are concerned. About 30-60 minutes
We are pleased to announce Version 0.21a, the initial functioning
release of Shaskell, our SHA2 library for (so far) ghc6. It supports
sha256 and sha512 hashes in this version, and is pure: no monads or
C libraries are involved!
Source and Ubuntu 5.04 binaries are at:
On Tue, Dec 27, 2005 at 01:36:53AM -0700, David Mercer wrote:
We are pleased to announce Version 0.21a, the initial functioning
release of Shaskell, our SHA2 library for (so far) ghc6. It supports
sha256 and sha512 hashes in this version, and is pure: no monads or
C libraries are involved!
On Fri, Dec 23, 2005 at 12:10:07PM +0100, Tomasz Zielonka wrote:
On Fri, Dec 23, 2005 at 03:34:40AM -, [EMAIL PROTECTED] wrote:
[Sorry for possible duplication, our DNS server seems to be broken,
and the sysadm is on vacation]
I don't think that is the problem with GADTs. The
On Fri, Oct 14, 2005 at 04:35:24PM +0100, Simon Peyton-Jones wrote:
Stephanie and Dimitrios and I are now busy revising our wobbly-types
GADT paper (which is implemented in GHC, but never published
http://research.microsoft.com/%7Esimonpj/papers/gadt/index.htm). We
have a *far* simpler story
I'm pleased to announce version 0.99.0 of HDBC, HDCB-postgresql, and
HDBC-sqlite3.
Tar.gz downloads are available at htp://quux.org/devel/hdbc.
Darcs repositories are available under http://darcs.complete.org/.
I have uploaded these three packages to Debian (sid).
This release is intended as a
On Tue, 27 Dec 2005 15:17:50 -0500, Dave Roundy wrote:
On Tue, Dec 27, 2005 at 01:36:53AM -0700, David Mercer wrote:
We are pleased to announce Version 0.21a, the initial functioning
release of Shaskell, our SHA2 library for (so far) ghc6. It supports
sha256 and sha512 hashes in this version,
David Mercer writes:
Speaking of testing, is anyone aware of any good test
harnesses for benchmark comparison testing, it's been
quite a while since I cared about such things and am out
of touch with that corner of computing!
At http://cryp.to/hopenssl/ you'll find Haskell bindings
to
Tomasz Zielonka wrote:
I tried to implement another function:
mapChildren :: (forall a. Term f a - Term f a) - Term f b - Term f b
mapChildren fun t@(Lit x) = t
mapChildren fun (IsZero t) = IsZero (fun t)
mapChildren fun (Succ t) = Succ (fun t)
mapChildren fun (If c t e) = If
Tomasz Zielonka wrote:
The papers on GADTs have an example showing how you can transform,
traverse and evaluate ASTs (or terms) with more type safety. I've
used such an approach in one of my applications and it works remarkably
well.
However, I would like to be able to turn off that
On Tue, Dec 27, 2005 at 08:07:39PM -0800, [EMAIL PROTECTED] wrote:
Tomasz Zielonka wrote:
The papers on GADTs have an example showing how you can transform,
traverse and evaluate ASTs (or terms) with more type safety. I've
used such an approach in one of my applications and it works
It might also be worth looking at the networking code in House given the
intended application is parsing network packets.
See http://www.cse.ogi.edu/~hallgren/House/kernel/pfe.cgi?Net.PacketParsing,
for example.
Dominic.
___
Haskell-Cafe mailing
Tomasz,
Try http://wagerlabs.com/timeleak.tgz. See the Killer pickler
combinators thread as well.
My desired goal is to have 4k bots (threads?) running at the same
time. At, say, 1k/s per bot I figure something like 4Mb/s round-trip.
Each bot cannot spend more than a couple of seconds on
Hello Pupeno,
Tuesday, December 27, 2005, 7:10:24 AM, you wrote:
P It seems I have found a hole in Haskell... :(
lazy language can't contain holes, they are just yet unevaluated thunks :)
P I basically need a set of functions to read binary data out of a Handle (a
P higher lever of hGetBuf and
From: Joel Reymont [EMAIL PROTECTED]
To: Tomasz Zielonka [EMAIL PROTECTED]
CC: Jeremy Shaw [EMAIL PROTECTED],haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] binary IO
Date: Tue, 27 Dec 2005 09:18:54 +
Tomasz,
Try http://wagerlabs.com/timeleak.tgz. See the Killer pickler
We'll see, Erlang is built for this type of stuff. I might have
results from the timeleak test today and will probably have first
networking results tomorrow.
But I wish I could achieve even a fraction of that with Haskell.
On Dec 27, 2005, at 9:51 AM, Branimir Maksimovic wrote:
I have
Hello Joel,
Tuesday, December 27, 2005, 12:18:54 PM, you wrote:
JR My desired goal is to have 4k bots (threads?) running at the same
JR time. At, say, 1k/s per bot I figure something like 4Mb/s round-trip.
no problem. my library handle about 10-15mb/s, and i think that speed can
be doubled by
On Tuesday 27 December 2005 02:10, Jeremy Shaw wrote:
they do not care about big endian vs little endian.
Does it mean that it just reads the data in whatever endianess the computer is
in, right ?
However, while the Binary class in NewBinary may not be appropriate,
the uniform interface to
Bulat,
On Dec 27, 2005, at 1:58 PM, Bulat Ziganshin wrote:
no problem. my library handle about 10-15mb/s, and i think that
speed can
be doubled by using unboxed ints
Would you like to present your version of the timeleak code plus
statistics from a test run?
This will demonstrate the
Hello Pupeno,
Tuesday, December 27, 2005, 6:12:37 PM, you wrote:
they do not care about big endian vs little endian.
P Does it mean that it just reads the data in whatever endianess the computer
is
P in, right ?
NewBinary read/write data in so-called network format, which is the
same as in
Happy Holidays,
I was wondering if it this small snippet of code could be altered to
require fewer OPTIONS -fallow-... switches.
It creates a show-what-i-mean function called swim that takes a
variable number of arguments, and treats strings as-is, calling show on
the other arguments.
{-#
Hello Joel,
Tuesday, December 27, 2005, 6:24:56 PM, you wrote:
no problem. my library handle about 10-15mb/s, and i think that
speed can be doubled by using unboxed ints
JR Would you like to present your version of the timeleak code plus
JR statistics from a test run?
do it yourself. i
On Dec 27, 2005, at 4:52 PM, Bulat Ziganshin wrote:
spending several weeks to random
optimization is like buying a gold computer case trying to speed up
the game :)
I did not spend several weeks on optimization. I went through about
25 iterations with the timeleak code and the profiler. I
Pupeno wrote:
On Monday 26 December 2005 02:41, Donn Cave wrote:
I don't think it will be too much worse. I would not try to
combine the struct updates, in the both case -- it doesn't buy
you anything, and pulls you into duplication you don't want.
What about this
runDaytimeServer ::
On Tue, 2005-12-27 at 18:35 +, Joel Reymont wrote:
Hi Joel!
Then we can lay out the series of profiling reports in a storyboard
of sorts, with changes from report to report described. This would
serve a great how to write efficient Haskell manual.
We are with you watching your
That's great to hear! I will continue once I have a chance to discuss
it with the gurus and optimize it further. At the same time, I would
challenge everyone with a fast IO library to plug it into the
timeleak code, run it under a profiler and post the results (report +
any alarms).
The
Max Vasin wrote:
Pupeno wrote:
What about this
runDaytimeServer :: DaytimeServer - IO DaytimeServer
runDaytimeServer dts = do
dts' - runStreamDaytimeServer dts
dts' - runDgramDaytimeServer dts'
return dts'
runDaytimeServer dts
= runStreamDaytimeServer dts = runDgramDaytimeServer
Joel Reymont writes:
I would challenge everyone with a fast IO library to plug
it into the timeleak code, run it under a profiler and
post the results (report + any alarms).
My guess is that you would learn more if _you_ would plug
the different IO libraries into your test code. I'm
I will have to leave this for a while. I apologize but I'm
more than a bit frustrated at the moment and it's not fair
of me to take it out on everybody else.
If someone is willing to take this further I will appreciate it,
otherwise I'll get to it in the coming weeks. Besides knowing
how to do
On Tue, Dec 27, 2005 at 09:18:54AM +, Joel Reymont wrote:
Try http://wagerlabs.com/timeleak.tgz. See the Killer pickler
combinators thread as well.
Let's see if I understand correctly. There are 17605 messages in
trace.dat. On my hardware the average message unpicking time is 0.0002s
when
On Tue, Dec 27, 2005 at 04:39:34PM +, Chris Kuklewicz wrote:
Happy Holidays,
I was wondering if it this small snippet of code could be altered to
require fewer OPTIONS -fallow-... switches.
It creates a show-what-i-mean function called swim that takes a
variable number of arguments,
Tomasz Zielonka wrote:
On Tue, Dec 27, 2005 at 04:39:34PM +, Chris Kuklewicz wrote:
Happy Holidays,
I was wondering if it this small snippet of code could be altered to
require fewer OPTIONS -fallow-... switches.
It creates a show-what-i-mean function called swim that takes a
variable
Joel Reymont writes:
I will have to leave this for a while. I apologize but
I'm more than a bit frustrated at the moment and it's not
fair of me to take it out on everybody else.
Never mind. Haskell has a very high potential for frustrating
newcomers. I went through the exact same
On 2005-12-20, Daniel Carrera [EMAIL PROTECTED] wrote:
Hi all,
I've finished a first draft of what I call First steps in Haskell.
It's intended to be the very first thing a new user sees when they
decide to try out Haskell.
I should point out a parallel effort that a few of us have worked
Greetings,
It seems there are a lot of people working on database-related things in
Haskell. HaskellDB, wxHaskell, HDBC, HSQL, etc. I'm wondering if it
would make sense to have a haskell-db mailing list to help coordinate
efforts? (Or even just to help manage development on these projects
Hello,
After trying my own code and reading the whole thread I started to understand
NewBinary. I'm going to give it a try.
My question now is how to turn a Ptr into a BinHandle to use NewBinary on it,
or is there another way to do it ?
Thanks.
--
Pupeno [EMAIL PROTECTED] (http://pupeno.com)
Simon Marlow wrote:
Also, I would like to draw your attention to the
fact that GHC
wipes the floor with nearly everyone in the
concurrency
benchmark
SmartEiffel is so much faster that I'm still trying to
figure out if it's doing something different :-)
Be interesting to see GHC on the other
Jared Updike wrote:
What that means is the results are completely
subject to
(1) how good the submission for that tests was
Contribute faster more-elegant programs
http://shootout.alioth.debian.org/gp4/faq.php#contribute
(2) the choice of tests in the first place
Suggest better tests
Branimir Maksimovic wrote:
Of course, first example uses [String] instead of
Data.HashTable
as other languages do. Imagine C program does not
use
hash,rather list, how it will perform:)
And the author comments his program
-- This is a purely functional solution to the
problem.
-- An
45 matches
Mail list logo
