Hi all,
Do you know of a blog post about Haskell that wasn't syndicated on Planet
Haskell? Do you have a Haskell-related story to tell or announcement to
make? Do you have a link to some great pictures from the latest
meetup/hackathon/talk/conference? A funny story about Don Stewart?
If so,
=
The (Interactive) Glasgow Haskell Compiler -- version 6.8.3
=
The GHC Team is pleased to announce a new patchlevel release of GHC.
This release contains a number of
#2367: ASSERT failed! file basicTypes/MkId.lhs line 643
---+
Reporter: batterseapower | Owner:
Type: bug | Status: new
Priority: normal | Component:
#2368: ASSERT failed! file coreSyn/CorePrep.lhs line 669
---+
Reporter: batterseapower | Owner:
Type: bug | Status: new
#2369: tcrun007: Can't find interface-file declaration for variable
---+
Reporter: batterseapower | Owner:
Type: bug | Status: new
#2370: num009 fails on OS X 10.5?
---+
Reporter: batterseapower | Owner:
Type: bug | Status: new
Priority: normal | Component: Compiler
#1619: The RTS chokes on SIGPIPE (happens with runInteractiveCommand)
+---
Reporter: int-e | Owner:
Type: bug | Status: new
Priority: normal |
#2363: getChar cannot be interrupted with -threaded
+---
Reporter: simonmar| Owner:
Type: bug | Status: new
Priority: high| Milestone: 6.10
#2371: `ghci` prints confusing error message if using :m + instead of :load
+---
Reporter: bos | Owner:
Type: bug | Status: new
Priority: normal | Component:
Dan Doel wrote:
Issue 2: Reading from/writing to a MutableByteArray# is slower than an Addr#
This is, I think, the crux of the issue. The main content of the benchmark is
reversing/shifting items in an array. To get a somewhat easier look at the
core, I boiled things down to a benchmark that
On Tuesday 17 June 2008, Simon Marlow wrote:
So I tried your examples and the Addr# version looks slower than the MBA#
version:
Hmm...
I tried with 6.8.2 and 6.8.3, using -O2 in both cases. I tried the Ptr
version with and without -fvia-C -optc-O2, no difference.
I had forgotten about the
Am Dienstag, 17. Juni 2008 18:32 schrieb Dan Doel:
On Tuesday 17 June 2008, Simon Marlow wrote:
So I tried your examples and the Addr# version looks slower than the MBA#
version:
Hmm...
I tried with 6.8.2 and 6.8.3, using -O2 in both cases. I tried the Ptr
version with and without
On Tuesday 17 June 2008, Daniel Fischer wrote:
I've experimented a bit and found that Ptr is faster for small arrays (only
very slightly so if compiled with -fvia-C -optc-O3), but ByteArr performs
much better for larger arrays
...
The GC time for the Addr# version is frightening
I had an
=
The (Interactive) Glasgow Haskell Compiler -- version 6.8.3
=
The GHC Team is pleased to announce a new patchlevel release of GHC.
This release contains a number of
I see that Dan Doel's post favoring Ptr/Addr#
has the same allocation amounts (from +RTS -sstderr) for Ptr/Addr# and the
MutableByteArray#
Everyone else sees more allocation for Ptr/Addr# than MBA# and see MBA# as
faster in these cases.
I myself (on G4) see more allocation [just like Simon
Am Dienstag, 17. Juni 2008 20:35 schrieb Dan Doel:
On Tuesday 17 June 2008, Daniel Fischer wrote:
I've experimented a bit and found that Ptr is faster for small arrays
(only very slightly so if compiled with -fvia-C -optc-O3), but ByteArr
performs much better for larger arrays
...
The
On Tuesday 17 June 2008, [EMAIL PROTECTED] wrote:
I see that Dan Doel's post favoring Ptr/Addr#
has the same allocation amounts (from +RTS -sstderr) for Ptr/Addr# and the
MutableByteArray#
Everyone else sees more allocation for Ptr/Addr# than MBA# and see MBA# as
faster in these cases.
I
Here's something I just stumbled upon by accident: at least on Linux,
GHC emits huge numbers of symbols into the binaries it generates.
Here's Haddock, which I compiled without any funny debug options:
$ du -h haddock-0.9
4.1M haddock-0.9
$ nm haddock-0.9 | wc -l
37938
$ strip haddock-0.9
$ du
On Mon, 16 Jun 2008, Dan Doel wrote:
On Monday 16 June 2008, Evan Laforge wrote:
(huge negative number)
Ok, so integral types don't have that exceptional value. Shouldn't
trying to convert NaN or Infinity to an Integral throw something? Is
it a performance thing? I'd think if you're
Hi all,
There is something about polymorphic tests in QuickCheck that I do not
understand.
If you write the simplest dummy test function
tst :: a - Bool
tst _ = True
and evaluate it we get
verboseCheck tst
0:
()
1:
()
...
How come did the polymorphic value a get instanciated to ()? Is this
2008/6/17 Hugo Pacheco [EMAIL PROTECTED]:
Hi all,
There is something about polymorphic tests in QuickCheck that I do not
understand.
If you write the simplest dummy test function
tst :: a - Bool
tst _ = True
and evaluate it we get
verboseCheck tst
0:
()
1:
()
...
How come did the
It does not seem like printing the result value from IO (), because with a
more complicated example for lists.
t :: [a] - Bool
t x = True
then it randomly generates values of type [()].
*Quick verboseCheck t
0:
[]
1:
[()]
2:
[(),(),()]
3:
[]
4:
[()]
5:
[(),(),(),()]
I just wonder how the a got
On Jun 17, 2008, at 11:53 AM, Hugo Pacheco wrote:
Hi all,
There is something about polymorphic tests in QuickCheck that I do
not understand.
If you write the simplest dummy test function
tst :: a - Bool
tst _ = True
and evaluate it we get
verboseCheck tst
0:
()
1:
()
...
How come did
Ariel J. Birnbaum [EMAIL PROTECTED] writes:
In the mean time -- who knows enough to make ghc target
ARM, and get this to link against the iPhone libraries?
This would be quite a coup if it could be made to run
there!
For that matter, there's another ARM-based target in which
I'm interested:
Hello
I'm using GHC to compile around 700K of Haskell Code generated by HaXml.
How I compile this code.
My machine is Windows-XP(512MB RAM, 1.5GHz) running GHC-6.8.2.
How much time it spend to compile this file?
I spent more than 1 hour and it doesn't finished.
What flags make compiling fast?
I
Hello Samuel,
Tuesday, June 17, 2008, 4:19:47 PM, you wrote:
My machine is Windows-XP(512MB RAM, 1.5GHz) running GHC-6.8.2.
What flags make compiling fast?
I try with -H500m but dont't expect.
bad idea since OS needs memory too. -H400m would be much better
--
Best regards,
Bulat
I would assume -O0, that is, turning off all optimizations, should
make compilation faster
Adrian
Am 17.06.2008 um 14:19 schrieb Samuel Silva:
Hello
I'm using GHC to compile around 700K of Haskell Code generated by
HaXml.
How I compile this code.
My machine is Windows-XP(512MB RAM,
Hi guys,
Sorry for a silly questions but I didn't find a proper answer in Google.
I've started to learn Haskell and would like to implement a library for work
with vectors. I found different implementations of this stuff but all of
them made just for fun in a short as possible terms using lists
On Tue, Jun 17, 2008 at 04:04:11PM +0100, Olex P wrote:
Hi guys,
Sorry for a silly questions but I didn't find a proper answer in Google.
I've started to learn Haskell and would like to implement a library for work
with vectors. I found different implementations of this stuff but all of
hoknamahn:
Hi guys,
Sorry for a silly questions but I didn't find a proper answer in Google.
I've started to learn Haskell and would like to implement a library for
work with vectors. I found different implementations of this stuff but all
of them made just for fun in a short
magicloud.magiclouds:
OK. Here it is.
I want to make a monitor tool for linux. It runs for a long time, and give
out a certain process's io stat per second. The way I get io stat is to read
from /proc/pid/io. But the data in this file is a total, I need to read it
first, then next second,
dons:
magicloud.magiclouds:
OK. Here it is.
I want to make a monitor tool for linux. It runs for a long time, and give
out a certain process's io stat per second. The way I get io stat is to read
from /proc/pid/io. But the data in this file is a total, I need to read it
first, then next
Hi,
The PHP community is discussing the adding of closures and lambdas to
the language, see the proposal at http://wiki.php.net/rfc/closures
If someone with knowledge of both languages could take a quick look it
would be great.
Thanks a lot
Karoly Negyesi
Ps. I am not a member of the PHP
On Tue, 17 Jun 2008, Olex P wrote:
Hi guys,
Sorry for a silly questions but I didn't find a proper answer in Google.
I've started to learn Haskell and would like to implement a library for work
with vectors.
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hmatrix
Blimey! Talk about rearranging the deckchairs :-)
With respect, do you not think it'd be wiser for the community to
deal with a total lack of proper type checking, the lack of any
notion of the general concept of a function, or a whole range of
other fundamental issues in PHP first before
Thank you guys, I'll check it.
On Tue, Jun 17, 2008 at 4:30 PM, Henning Thielemann
[EMAIL PROTECTED] wrote:
On Tue, 17 Jun 2008, Olex P wrote:
Hi guys,
Sorry for a silly questions but I didn't find a proper answer in Google.
I've started to learn Haskell and would like to implement a
On Tue, Jun 17, 2008 at 07:55:51AM +0100, Neil Mitchell wrote:
Hi,
Hello!
David:
Is there any reason not to just write all lazy fields of variable size
in a deferred manner?
I completely hadn't though of this! You will loose a bit of time, for
example reading fields which were
On Tue, Jun 17, 2008 at 08:24:58AM -0700, John Meacham wrote:
You can also create helper functions like
v3 = Vector3
so you can do (v3 1 2 3 + v3 4 5 6)
Or just use
data Vector3 = V3 !Float !Float !Float
and you've got compact pattern matching as well as constructing.
David
On Tue, Jun 17, 2008 at 08:56:31AM -0700, Don Stewart wrote:
dons:
magicloud.magiclouds:
OK. Here it is.
I want to make a monitor tool for linux. It runs for a long time, and give
out a certain process's io stat per second. The way I get io stat is to
read
from /proc/pid/io. But
Hi all,
Do you know of a blog post about Haskell that wasn't syndicated on Planet
Haskell? Do you have a Haskell-related story to tell or announcement to
make? Do you have a link to some great pictures from the latest
meetup/hackathon/talk/conference? A funny story about Don Stewart?
If so,
Calm down, PR, that's not so bad, all we're going to see is an example
of closures done wrong, nothing more.
On 17 Jun 2008, at 21:46, PR Stanley wrote:
Blimey! Talk about rearranging the deckchairs :-)
With respect, do you not think it'd be wiser for the community to
deal with a total
PR Stanley [EMAIL PROTECTED] wrote:
Blimey! Talk about rearranging the deckchairs :-)
With respect, do you not think it'd be wiser for the community to
deal with a total lack of proper type checking, the lack of any
notion of the general concept of a function, or a whole range of
other
But all the cool kids have em!
Seriously though computer languages are about getting things done.
If this gets more things done for the PHP community in ways
easier/simpler/faster than before then it's a win.
They are after all /their/ deckchairs to play with.
-ljr
PR Stanley wrote:
Blimey!
You are right!
If I try to compile it, then it complains about a Show instance for a, what
in fact forces a monomorphic type signature for t.
I have found under Test.Quickcheck.Poly a way to generate Int values for a
polymorphic type, but because it requires an abstraction Poly a for some
type a
xj2106:
Ariel J. Birnbaum [EMAIL PROTECTED] writes:
In the mean time -- who knows enough to make ghc target
ARM, and get this to link against the iPhone libraries?
This would be quite a coup if it could be made to run
there!
For that matter, there's another ARM-based target in which
silva.samuel:
Hello
I'm using GHC to compile around 700K of Haskell Code generated by HaXml.
How I compile this code.
My machine is Windows-XP(512MB RAM, 1.5GHz) running GHC-6.8.2.
How much time it spend to compile this file?
I spent more than 1 hour and it doesn't finished.
What
I'm trying to wrap my head around the theoretical aspects of haskell's
type system. Is there a discussion of the topic separate from the
language itself?
Since I come from a rather logic-y background, I have this
(far-fetched) hope that there is a translation from haskell's type
syntax to first
Excerpts from David Roundy's message of Tue Jun 17 20:27:01 +0200 2008:
On Tue, Jun 17, 2008 at 07:55:51AM +0100, Neil Mitchell wrote:
Hi,
Hello!
Hello,
:( Lazy reading seems to
require strict writing, while lazy writing requires strict reading!
I'm wondering if it would be an option to
On Tue, 2008-06-17 at 13:19 +0100, Samuel Silva wrote:
I'm using GHC to compile around 700K of Haskell Code generated by HaXml.
How I compile this code.
My machine is Windows-XP(512MB RAM, 1.5GHz) running GHC-6.8.2.
How much time it spend to compile this file?
I spent more than 1 hour and
But all the cool kids have em!
Seriously though computer languages are about getting things done.
If this gets more things done for the PHP community in ways
easier/simpler/faster than before then it's a win.
nerve gas would sort out the problem with mice in our
building too, easier
2008/6/17 Achim Schneider [EMAIL PROTECTED]:
PR Stanley [EMAIL PROTECTED] wrote:
Blimey! Talk about rearranging the deckchairs :-)
With respect, do you not think it'd be wiser for the community to
deal with a total lack of proper type checking, the lack of any
notion of the general concept
51 matches
Mail list logo
