Tomasz Zielonka wrote:
On Tue, Sep 26, 2006 at 01:46:30AM +0100, Ian Lynagh wrote:
I couldn't reproduce this with a simple program that forked off 4
threads to do computation on a single CPU machine, and neither could
someone on IRC with head from Sep 15 on a Core Duo.
Is it possible to send
#16: Extensionsflags
--+-
Reporter: axelkr | Owner: igloo
Type: feature request | Status: new
Priority: normal | Milestone:
Component: Compiler
#905: the `impossible' happened: ASSERT failed! file codeGen/ClosureInfo.lhs,
line 596
--+-
Reporter: Misha Aizatulin [EMAIL PROTECTED] | Owner:
Type: bug |
Brian Smith wrote:
On 9/26/06, *Simon Marlow* [EMAIL PROTECTED]
mailto:[EMAIL PROTECTED] wrote:
Brian Smith wrote:
The test always failed. When I decreased the number of threads in the
test from 5,000 to 1,400 or so, then the tests passed sometimes, and
sometimes
#910: --make should have a -j flag for parallel building
--+-
Reporter: igloo| Owner:
Type: feature request | Status: new
Priority: normal | Milestone:
#880: someFunction :: TypeRep - Int
--+-
Reporter: guest| Owner:
Type: feature request | Status: new
Priority: normal | Milestone:
Component:
#880: someFunction :: TypeRep - Int
--+-
Reporter: guest| Owner:
Type: feature request | Status: closed
Priority: normal | Milestone:
Component:
#911: Better information about the location of exceptions
+---
Reporter: simonmar |Owner:
Type: feature request | Status: new
Priority: normal |Milestone:
On Wed, Sep 27, 2006 at 09:25:39AM +0100, Simon Marlow wrote:
Perhaps clock_gettime() is returning strange results on your system. Could
you try compiling with -threaded -debug, and run the program under gdb.
When I compile with -threaded -debug, the stats are OK :-/
Best regards
Tomasz
Tomasz Zielonka wrote:
On Wed, Sep 27, 2006 at 09:25:39AM +0100, Simon Marlow wrote:
Perhaps clock_gettime() is returning strange results on your system. Could
you try compiling with -threaded -debug, and run the program under gdb.
When I compile with -threaded -debug, the stats are OK
On Wed, Sep 27, 2006 at 12:06:34PM +0100, Simon Marlow wrote:
When I compile with -threaded -debug, the stats are OK :-/
Ok, maybe try strace?
Nothing suspicious, at least for me. Strace logs attached.
I'll try to compile GHC from sources and put some debugging
prints in the RTS. There
#887: GHCi prints results of IO actions
--+-
Reporter: guest| Owner:
Type: bug | Status: closed
Priority: normal | Milestone:
Component: GHCi |
#806: hGetBufNonBlocking doesn't work with -threaded on Windows
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority: normal |
#912: Build system is missing various dependencies
-+--
Reporter: simonmar |Owner:
Type: bug | Status: new
Priority: normal|Milestone:
#710: library reorganisation
-+--
Reporter: simonmar| Owner:
Type: task| Status: new
Priority: normal | Milestone: 6.8
Component:
On Thu, Sep 21, 2006 at 08:03:53PM +0200, Tomasz Zielonka wrote:
Hello!
I am getting nonsensical execution statistics (+RTS -Sstderr) when
running programs in SMP mode (+RTS -N2).
I've found a machine which had the same problem. I think I've fixed it with
Thu Sep 28 00:46:30 BST 2006 Ian
#867: Integer arithmetic gives the wrong answer on amd64/Linux
---+
Reporter: igloo | Owner:
Type: bug | Status: closed
Priority: normal| Milestone:
On 9/26/06, Simon Marlow [EMAIL PROTECTED]
wrote:
Brian Smith wrote: Now, when I tried to rerun the tests against the latest ghc-6.6, ghc.exe is segfaulting on ffi012(ghci), conc049(ghci), and conc023(ghci): Unhandled exception at 0x0207fc58 in
ghc.exe: 0xC005: Access violation.That's a bit
Fortress (sun's possibly-not-vaporware hpc language) supports arbitrary
unicode chars in code, and has an escape syntax for commonly used things.
Similarly, proof-general/isabelle supports tex-style escapes for symbols
greek. It seems to me that a pre-processor that turns human-friendly
Hello Cyril,
Tuesday, September 26, 2006, 1:30:23 AM, you wrote:
I am afraid I would need the new Time library a little earlier than 2038,
because I am working on financial software where it is not uncommon to
have contracts
over 30 years long.
of course i'm joking. i even don't known is
Bulat Ziganshin wrote:
how about adding to the list of extra libs the following very useful ones:
regex-*
FilePath
MissingH
Edison
Let me echo what Ian said: the idea with extralibs was not to bundle useful
stuff with GHC, but rather to *separate* from GHC as many of the bundled
libraries
Duncan Coutts wrote:
On Sun, 2006-09-24 at 01:28 +0400, Bulat Ziganshin wrote:
Hello Duncan,
Sunday, September 24, 2006, 12:22:38 AM, you wrote:
after program prints 40 mb allocated look at Task Manager indication
- it shows that two times more memory actually in use. it seems that
problem
Christian Maeder wrote:
Simon Marlow schrieb:
Only a week late, we are pleased to announce the Release Candidate phase
for GHC 6.6.
Snapshots beginning with 6.5.20060831 are release candidates for 6.6
Download snapshots from here:
http://www.haskell.org/ghc/dist/current/dist/
I've
Simon Marlow schrieb:
Christian Maeder wrote:
I've downloaded the source bundle ghc-6.5.20060918-src.tar.bz
After ./configure and make, I realized that I have no root permissions
for installation. So called
./configure --prefix=/local/home/maeder/ghc-6.5
followed by make and make install
I added notes about this to
http://haskell.org/haskellwiki/Performance/GHC
S
| -Original Message-
| From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED]
| On Behalf Of Simon Marlow
| Sent: 27 September 2006 13:44
| To: Duncan Coutts
| Cc: glasgow-haskell-users@haskell.org
|
On Fri, Sep 15, 2006 at 05:20:36PM +0100, Ian Lynagh wrote:
As it happens I was working on getting GHC to use cabal to build base
et al on the plane the other day, and I had a brief look at this.
See my comment in
http://hackage.haskell.org/trac/ghc/ticket/710
for the results of my longer
The flags under section
4.17.26. Compiler debugging options
seem to be out of date. They seem to be wrong for both 6.42 and 6.6
For example --ddump-cmm is not listed, but works.
But --ddump-absC is listed, and gives the error unknown flag.
I can't get -ddump-stix to work either.
Gone, or
On Sep 27, 2006, at 6:05 AM, Matthew Pocock wrote:
Fortress (sun's possibly-not-vaporware hpc language) supports
arbitrary
unicode chars in code, and has an escape syntax for commonly used
things.
I have spent the past week writing Fortress code (which runs in
parallel, even). But I'm
Simon Peyton-Jones wrote:
Concerning your application
| I am having a box like
| data Box = forall a. Cxt a = Box a
| and want to write a Read instances for it.
I don’t see how it helps to defer the Read instance.
I would defer the instance declaration till the point where I know
---
Haskell Weekly News
http://haskell.org/haskellwiki/HWN
Issue 42 - September 27, 2006
---
Welcome to issue 42 of HWN, a weekly newsletter covering
On Fri, Sep 15, 2006 at 05:20:36PM +0100, Ian Lynagh wrote:
As it happens I was working on getting GHC to use cabal to build base
et al on the plane the other day, and I had a brief look at this.
See my comment in
http://hackage.haskell.org/trac/ghc/ticket/710
for the results of my longer
Ravi Nanavati has very helpfully put together a status report for the
Haskell Prime process. Please see this link, or read the pasted text
below:
http://hackage.haskell.org/trac/haskell-prime/wiki/Status'
peace,
isaac
Summary:
Since the Haskell Workshop last year, the Haskell community
Greetings,
As announced at the Haskell Workshop, the Haskell Prime process is
running another committee selection round. We are specifically
looking for people to write sections of the Haskell Report for the
definitely in and probably in proposals, as described in:
One thing jumped out at me from the status report: everything was add,
which reminded me of many old languages designed by accretion.
Are the new facilities so perfectly orthogonal as not to subsume anything
that was already there? Are none of them simply relaxations of previous
limitatations?
Ravi Nanavati has very helpfully put together a status report for the
Haskell Prime process. Please see this link, or read the pasted text
below:
http://hackage.haskell.org/trac/haskell-prime/wiki/Status'
peace,
isaac
Summary:
Since the Haskell Workshop last year, the Haskell community
What do the various values of the Component field mean? Most issues
have Proposal, but some have HaskellPrime.
--
Ashley Yakeley
Seattle WA
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-prime
On Wed, 2006-09-27 at 16:27 -0700, Ashley Yakeley wrote:
What do the various values of the Component field mean? Most issues
have Proposal, but some have HaskellPrime.
If it is a proposal for something to go into/be removed from the
language, then it should be listed as proposal. If it's some
isaac jones wrote:
On Wed, 2006-09-27 at 16:27 -0700, Ashley Yakeley wrote:
What do the various values of the Component field mean? Most issues
have Proposal, but some have HaskellPrime.
If it is a proposal for something to go into/be removed from the
language, then it should be listed as
Jason Dagit [EMAIL PROTECTED] writes:
Ubuntu seems to be a bit behind then. The current official release of
the 6.4 branch is at 6.4.2. Debian seems to provide this version,
maybe you can use the debian package? But, if I were you I wouldn't
worry so much about upgrading ghc but instead
Hi
On 9/27/06, Matthew Bromberg [EMAIL PROTECTED] wrote:
though I have a binary build of ghc 6.5
If you have new ghc 6.5, you can use --mk-dll with --make, in case that helps.
ghc --mk-dll -o netsim.dll ExternLib.o ExternLib_stub.o dllNet.o src1.o
src1_stub.o src2.o -optl-lmatrixstack
Matthew,
As regards the symbols that end with _closure, I believe you can
resolve them by adding
-package parsec
to the ghc command line (as far as I can see, all the symbols you
list come from the parsec package).
I don't know, though, what to do with the undefined symbols from
matrixstack. You
Ketil Malde [EMAIL PROTECTED] writes:
I filed a request to backport [ghc 6.4.2 to Ubuntu Dapper], but for
some reason, I am unable to find it again.
Hah! Found it (with some IRC assistance):
https://launchpad.net/distros/ubuntu/+source/ghc6/+bug/56516
-k
--
If I haven't seen further, it
On 9/27/06, Lyle Kopnicky [EMAIL PROTECTED] wrote:
Hi folks,
It turns out Haskell is vindicated. It's my algorithm that was slow. As
Robert Dockins pointed out, the double nested loop is just going to take
a long time.
As evidence, it turns out my C++ version is just as slow as the Haskell
Lyle Kopnicky [EMAIL PROTECTED] writes:
If you have some other metric other than prefix in mind for partial
matches, then things probably get a lot more complicated. You're
probably looking at calculating minimum distances in some
feature-space, which calls for pretty sophisticated
On 9/27/06, Johan Tibell [EMAIL PROTECTED] wrote:
On 9/27/06, Lyle Kopnicky [EMAIL PROTECTED] wrote:
Hi folks,
It turns out Haskell is vindicated. It's my algorithm that was slow. As
Robert Dockins pointed out, the double nested loop is just going to take
a long time.
As evidence, it
Hello Max,
Monday, September 25, 2006, 10:41:20 PM, you wrote:
Ch That's a religious statement. I was looking for some strong
Ch arguments for the nonbelievers that Haskell is a 5GL.
But what about nonbelievers in language classification by generation?
i was not on the market when 1..3 GLs
Hello Bill,
Tuesday, September 26, 2006, 1:03:02 AM, you wrote:
I spent some time working on a large Prolog application where
performance was critical,
...
I think you're right that Haskell should
be in the same bag as Prolog.
and Haskell is the same as C++ when performance is critical,
There is also the HAppS application server and the HaskellNet library.
Would not be possible to merge the protocol-handling parts of all these
libraries into a generic Internet Haskell server that could then be expanded
to support CGIs, transactions, etc.?
Regards,
titto
-Original
This is a follow-up to a thread from June-July[1]. The question was how to
write the function
initlast :: [a] - ([a], a)
initlast xs = (init xs, last xs)
so that it can be consumed in fixed space:
main = print $ case initlast [0..10] of
(init, last) -
Hi,
an experienced person at our lab told me that the classification
into generations has become unfashioned in the last decade;
thus I think I will stay away from using it but argue with
concrete abstraction features.
Concerning the point someone made about the features of Haskell:
* pattern
Well I tried this statement
ghc --mk-dll -fglasgow-exts -fffi -I. --make ExternLib.hs
It only compiled the object file, creating ExternLib.o, but it did not
create the stub file or attempt to link in the dependent packages. I then
went back to this,
ghc --mk-dll -fglasgow-exts -fffi -o
Andrew Pimlott wrote:
This is a follow-up to a thread from June-July[1]. The question was how to
write the function
initlast :: [a] - ([a], a)
initlast xs = (init xs, last xs)
so that it can be consumed in fixed space:
main = print $ case initlast [0..10] of
Ketil Malde wrote:
Do you really need that to search for movie titles? At any rate, an
exact-match finite-map implementation is a good start - to get good
performance, you probably will need to use some kind of index to
reduce the amount of data to search exhaustively (all-against-all).
For
Lyle == Lyle Kopnicky [EMAIL PROTECTED] writes:
Lyle My question is, when I do 'make install', will it just overwrite
Lyle the version (6.4.1) I already have? Or will they go in separate
Lyle places?
This depends on the prefix you configured sources with (/usr/local by default).
Lyle I have no
On 9/26/06, Matthew Bromberg [EMAIL PROTECTED] wrote:
I am having some difficulty with creating a dynamic link library using
GHC on windows XP.
I am attempting to follow the example in
http://www.haskell.org/ghc/docs/6.4/html/users_guide/win32-dlls.html
though I have a binary build of ghc 6.5
Ketil Malde wrote:
Lyle Kopnicky [EMAIL PROTECTED] writes:
If you have some other metric other than prefix in mind for partial
matches, then things probably get a lot more complicated. You're
probably looking at calculating minimum distances in some
feature-space, which calls for pretty
Max Vasin wrote:
Lyle I have no idea how it decides where to go. Right now ghc
Lyle 6.4.1 is in /usr/local/bin/ghc. After I 'make install', will it
Lyle be ghc 6.5? I don't want to screw up the installed package so it
Lyle can't be updated later.
It should be :-)
It should be screwed up? Or
Hi -
Consider the scenario when you want to find a function that returns the i'th
element of an array but all you know is that there is a module called
Data.Array.IArray that will probably have such a function in it. So you
start typing in your program:
let
ith = Data.Array.IArray.
I was reading on p. 29 of A History of Haskell (a great read, by the
way) about the controversy of adding seq to the language. But other
than for efficiency reasons, is there really any new primitive that
needs to be added to support this?
As long as the compiler doesn't optimize it away, why
Hello,
I tried to create a type class for making instances of Show display a
custom way. After using my class for a while I found that sometimes
RealFloats would display as 'NaN' and this is unacceptable. So at
this point I had something like:
{-# OPTIONS_GHC -fglasgow-exts
On 9/27/06, Chad Scherrer [EMAIL PROTECTED] wrote:
I was reading on p. 29 of A History of Haskell (a great read, by the
way) about the controversy of adding seq to the language. But other
than for efficiency reasons, is there really any new primitive that
needs to be added to support this?
As
Brian Hulley wrote:
Hi -
Consider the scenario when you want to find a function that returns
the i'th element of an array but all you know is that there is a
module called Data.Array.IArray that will probably have such a
function in it. So you start typing in your program:
let
ith
There must be a subtlety I'm missing, right?
What if the types are not instances of Eq?
Jason
Thanks, I figured it was something simple. Now I just to convince
myself there's no way around that. Is there a proof around somewhere?
--
Chad Scherrer
Time flies like an arrow; fruit flies
Chad Scherrer wrote:
I was reading on p. 29 of A History of Haskell (a great read, by the
way) about the controversy of adding seq to the language. But other
than for efficiency reasons, is there really any new primitive that
needs to be added to support this?
As long as the compiler
Jason Dagit wrote:
On 9/27/06, SevenThunders [EMAIL PROTECTED] wrote:
Does cabal really work on windows?
I've never had a problem with cabal on windows. I use it instead of
makefiles and I'm reasonably happy with it.
Although it's installed I notice that
when I try to build my
Chad Scherrer wrote:
Prelude let sq x y = if x == x then y else y
Prelude 1 `sq` 2
2
Prelude (length [1..]) `sq` 2
Interrupted.
There must be a subtlety I'm missing, right?
Two, at least:
First, your sq has a different type, as it requires an Eq instance:
Prelude :t sq
sq :: (Eq a) = a -
SevenThunders wrote:
I am having some difficulty with creating a dynamic link library using
GHC on windows XP.
I am attempting to follow the example in
http://www.haskell.org/ghc/docs/6.4/html/users_guide/win32-dlls.html
though I have a binary build of ghc 6.5
My problem (I
On Wednesday 27 September 2006 22:20, Brian Hulley wrote:
(The other change needed for LL(1) is to give contexts a marker before they
appear eg:
foo :: {MonadIO m} a - m a
)
Or move contexts to the end of a type and separate it with a | like Clean
does: (See 6.2 of
Jeremy Gibbons wrote:
I haven't assimilated the forall here, but datatypes with only one shape
of data have been called Naperian by Peter Hancock (because they
support a notion of logarithm), and they're instances of McBride and
Paterson's idioms or applicative functors.
On Fri, Sep 15, 2006 at 05:12:34PM +0100, Neil Mitchell wrote:
So, just to confirm in my mind what you are proposing:
Compiler/Version specific Core:
Yhc.Core, Hugs.Core, GHC.Core
With a different version for each compiler version. Tied intimately to
the compiler.
A large issue
Since there's talk of removal of the composition operator in Haskell-prime, how about this:
Instead of:foo = f . gyou write:foo = .g.fA leading dot would mean, apply all unnamed parameters to the function on the right. A trailing dot would mean, apply the result of the left to the function on the
Michael Shulman wrote:
class TypeCast x y | x - y, y - x where
typeCast :: x - y
instance TypeCast x x where
typeCast = id
Anyway, my main question about typeCast is this: why is it needed here
at all?
First of all, there is a version of TypeCast that works within the
same
Greg Fitzgerald wrote:
Since there's talk of removal of the composition operator in
Haskell-prime
http://hackage.haskell.org/trac/haskell-prime/wiki/CompositionAsDot,
how about this:
Instead of:
foo = f . g
you write:
foo = .g.f
A leading dot would mean, apply all unnamed parameters to the
Brandon Moore wrote:
Greg Fitzgerald wrote:
Since there's talk of removal of the composition operator in
Haskell-prime
http://hackage.haskell.org/trac/haskell-prime/wiki/CompositionAsDot,
how about this:
Instead of:
foo = f . g
you write:
foo = .g.f
A leading dot would mean, apply all
SevenThunders wrote:
I am having some difficulty with creating a dynamic link library using
GHC on windows XP.
I need to report some additional strange DLL behavior with ghc.exe
unfortunately.
Although I solved my linking problems and was able to create a .dll and a MS
VC .lib file
I wrote:
Perhaps the key is that there exist types P and Q s.t. there's an
isomorphism
F a = (P - a,Q)
This seems to be intuitively Napierian:
ln (P - a,Q) = (P,ln a) | ln Q
I can believe that Hoistables are in fact Idioms, though I know there
are Idioms that are not Hoistables (Maybe
SevenThunders wrote:
SevenThunders wrote:
I am having some difficulty with creating a dynamic link library using
GHC on windows XP.
I need to report some additional strange DLL behavior with ghc.exe
unfortunately.
Although I solved my linking problems and was able to
On 9/27/06, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
First of all, there is a version of TypeCast that works within the
same module, please see any code described in
http://pobox.com/~oleg/ftp/Haskell/typecast.html
Yes, I was aware of that; I gave the shorter version just because
78 matches
Mail list logo
