Simon and I have no idea what's going on here. It doesn't happen for me
(on my Windows laptop).
Can anyone else reproduce this behaviour? If so, is anyone willing to
dive in a bit deeper and find out more about what is going on?
Regardless, creating a Trac bug report would ensure it doesn't
#603: GC-spy connection
-+--
Reporter: simonmar| Owner:
Type: task| Status: new
Priority: normal | Milestone:
Component:
#601: Replace GMP
-+--
Reporter: simonmar| Owner:
Type: task| Status: new
Priority: normal | Milestone:
Component: Compiler
#840: GHC on loosing its handles takes 100% CPU
-+--
Reporter: guest |Owner:
Type: bug | Status: new
Priority: normal|Milestone:
Component: Compiler
Hello GHC,
Wednesday, August 2, 2006, 4:33:09 PM, you wrote:
#840: GHC on loosing its handles takes 100% CPU
import System.Process
main = runInteractiveCommand ghc
When run terminates immediately, as expected, but leaves an instance
of ghc running. The ghc process takes up 100% of the
#820: problem compiling a file with top level Template Haskell splice
---+
Reporter: guest | Owner:
Type: bug | Status: new
Priority: normal
#798: Ix{Int}.index: Index (402849792) out of range ((0,100))
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority: normal |
#841: Build order causes errors when booting from HC files
---+
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug | Status: new
Priority: normal |
Lennart Augustsson wrote:
Actually, you can keep it to one test for add/subtract if you
use a single word that is either a number or a pointer, the
pointer being tagged in lowest bit. Then you can add first
and check for tags after. Having tags is rare, so the machine
should be told so, if
Hello Simon,
Wednesday, August 2, 2006, 4:05:51 PM, you wrote:
(2) We're concerned about performance. Replacing GMP, but losing
substantial performance on bignum-intensive programs would be
unattractive.
don't forget about speed/memory efficiency of any programs that use
Integer just for
Hi Bulat,
don't forget about speed/memory efficiency of any programs that use
Integer just for case but really most of their numbers fit in 32/64
bits. i have one particular program of this type - it builds list of
all files on disk and Integers are used to save filesizes. i will be
glad if,
Simon,
(1) We'd be delighted to use a BSD-licensed alternative to GMP in GHC.
It's been a long-standing issue, just never quite important enough to
get done. If either or both of you are willing to put in the legwork,
and emerge with an implementation that we understand and can maintain,
we'd
Hi Bulat,
the same binary that also wants to use GMP. (Of course, we could
*copy*
GMP, changing all the function names. That would eliminate the
problem!)
isn't it rather easy task for some automated tool? i think that even
existing tools may be found
I know copyrights are weak compared
On Wed, Aug 02, 2006 at 03:22:57PM -0400, Peter Tanski wrote:
I suppose that one alternative is to let the library use 'malloc', but
make a foreign-pointer proxy for every bignum, which calls 'free' when
the GHC garbage collector frees it. Not as efficient, though.
Esa and I had discussed
On 8/3/06, John Meacham [EMAIL PROTECTED] wrote:
On Wed, Aug 02, 2006 at 03:22:57PM -0400, Peter Tanski wrote:
Esa and I had discussed the possibility of copying the value returned
from the Bignum lib into the GHC system, which certainly would not be
very memory efficient, but might be
On Wed, Aug 02, 2006 at 01:06:48PM +0100, Simon Marlow wrote:
I like this idea - I remember discussing just such a scheme with John
Launchbury recently. It has a lot in common with the semi-tagging scheme
we've wanted to implement for some time, where the idea is that you use the
low bits
Hello John,
Thursday, August 3, 2006, 1:25:45 AM, you wrote:
evaluated. If the contents of the constructor itself can be packed into
the other 30 bits, then there's no need for a pointer at all. For
enumerated types, you can use all 31 bits for the tag, since only 1 bit is
required to
On Thu, Aug 03, 2006 at 02:12:15AM +0400, Bulat Ziganshin wrote:
the main condition is to use some special Int30# type instead of Int#
(which we got used to be 32 bits long). i.e. for the type [Char},
where Char= C# Int30# it will be ok, but for [Int] it will be bad
(i know about Haskell
Hi
(i know about Haskell standard, but how many programs relies on 32-bit
Ints?)
The standard demands the range [-2^29 .. 2^29 - 1]
You don't have a problem, some were reserved for you already.
Thanks
Neil
___
Glasgow-haskell-users mailing list
Dear all,
I am a Haskell newbie and I try to find my way through Monad territory.
Actually I am studying the non-deterministic monadic parser combinators as
descibed by Hutton and Meijer. Although I find this very elegant
and concise I seem to have problems extending the parser monads.
I use
Dear all,
I am a Haskell newbie and I try to find my way through Monad territory.
Actually I am studying the non-deterministic monadic parser combinators as
descibed by Hutton and Meijer. Although I find this very elegant
and concise I seem to have problems extending the parser monads.
I use
Announcing: TextRegexLazy version 0.56
Where: Tarball from http://sourceforge.net/projects/lazy-regex
darcs get --partial [--tag=0.56] http://evenmere.org/~chrisk/trl/stable/
License : BSD, except for DFAEngine.hs which is LGPL (derived from CTK light)
Development/unstable version is at:
Ooops.
I just patched the efficiency of ByteStringPCRE to agree with the original
announcement.
Use
darcs get --partial http://evenmere.org/~chrisk/trl/stable/
to get the fixed version.
A new 0.57 tarball will go to sourceforge soon.
Chris Kuklewicz wrote:
Announcing: TextRegexLazy version
Brian Hulley wrote:
Chris Kuklewicz wrote:
Announcing: TextRegexLazy version 0.56
Where: Tarball from http://sourceforge.net/projects/lazy-regex
darcs get --partial http://evenmere.org/~chrisk/trl/stable/
License : BSD, except for
Great! - Thanks for all your hard work in making this
Chris Kuklewicz wrote:
Announcing: TextRegexLazy version 0.56
Where: Tarball from http://sourceforge.net/projects/lazy-regex
darcs get --partial [--tag=0.56]
http://evenmere.org/~chrisk/trl/stable/ License : BSD, except for
Great! - Thanks for all your hard work in making this available
On Wed, Aug 02, 2006 at 10:52:14AM +0200, Harald ROTTER wrote:
newtype Parser a = Parser { runParser :: (PState - [(a, PState)])}
as the parsing monad with the Parser state PState that contains the
remaining input after matching and possibly some additional user defined
state elements. I
From the excellent programming blog Joel on software, a very good
text if you need to convince Java or C programmers that functional
programming is a A Good Thing.
Probably all the readers of this list will find it brings nothing new
(that's perfectly right) but it is oriented towards ordinary
On Wed, 2006-08-02 at 10:10 +0200, Stephane Bortzmeyer wrote:
From the excellent programming blog Joel on software, a very good
text if you need to convince Java or C programmers that functional
programming is a A Good Thing.
Probably all the readers of this list will find it brings nothing
Read a sentence like this If your programming language requires you to
use functors, you're not getting all the benefits of a modern
programming environment. See if you can get some of your money back.
If this is not a very subtle pun (regarding Java functors vs. Haskell
functors), which
Haskell is the most powerfull and interesting thing I'v ever
encountered in IT world. But with an imparative background and lack of
understanding (because of any thing include that maybe I am not that
smart) has brought me problems. I know this is an old issue. But
please help it.
Question :
kaveh.shahbazian:
Haskell is the most powerfull and interesting thing I'v ever
encountered in IT world. But with an imparative background and lack of
understanding (because of any thing include that maybe I am not that
smart) has brought me problems. I know this is an old issue. But
please
On 8/2/06, Kaveh Shahbazian [EMAIL PROTECTED] wrote:
Haskell is the most powerfull and interesting thing I'v ever
encountered in IT world. But with an imparative background and lack of
understanding (because of any thing include that maybe I am not that
smart) has brought me problems. I know
Monad Imparative Usage Example
Thanks for your replies. I have not haskell on this computer and I
will try this solutions tonight.
I must notice that IO computations is not the point here. My target is
to have this code for mutable variable 'var'.
Kaveh Shahbazian wrote:
Haskell is the most powerfull and interesting thing I'v ever
encountered in IT world. But with an imparative background and lack of
understanding (because of any thing include that maybe I am not that
smart) has brought me problems. I know this is an old issue. But
please
kaveh.shahbazian:
Monad Imparative Usage Example
Thanks for your replies. I have not haskell on this computer and I
will try this solutions tonight.
I must notice that IO computations is not the point here. My target is
to have this code for mutable variable 'var'.
Still not entirely clear
Am Mittwoch, 2. August 2006 11:56 schrieb Kaveh Shahbazian:
Haskell is the most powerfull and interesting thing I'v ever
encountered in IT world. But with an imparative background and lack of
understanding (because of any thing include that maybe I am not that
smart) has brought me problems. I
Announcing: TextRegexLazy version 0.56
Where: Tarball from http://sourceforge.net/projects/lazy-regex
darcs get --partial [--tag=0.56] http://evenmere.org/~chrisk/trl/stable/
License : BSD, except for DFAEngine.hs which is LGPL (derived from CTK light)
Development/unstable version is at:
Ooops.
I just patched the efficiency of ByteStringPCRE to agree with the original
announcement.
Use
darcs get --partial http://evenmere.org/~chrisk/trl/stable/
to get the fixed version.
A new 0.57 tarball will go to sourceforge soon.
Chris Kuklewicz wrote:
Announcing: TextRegexLazy version
Hello Ralf,
Wednesday, August 2, 2006, 1:27:39 PM, you wrote:
Read a sentence like this If your programming language requires you to
use functors, you're not getting all the benefits of a modern
programming environment. See if you can get some of your money back.
in the article history of
Hello Kaveh,
Wednesday, August 2, 2006, 1:56:10 PM, you wrote:
Question : Could anyone show me a sample of using a monad as a
statefull variable?
monad is not an stateful variable, it's the way to organize
computations, rule to join them (as the Ring of Supreme Power ;) ).
i recommend you to
On Wed, 2 Aug 2006, Donald Bruce Stewart wrote:
...
Of course, if you're learning Haskell, you should probably try to
/avoid/ mutable variables for a while.
Along the same line, I note that proposed solutions seem to use
features relatively recently added to the language, is that true?
StateT
On Tue, Aug 01, 2006 at 10:08:16PM +0200, Stephane Bortzmeyer wrote:
notFollowedBy seems to work for me and is quite simple, even for my
brain. Thanks.
Actually, it doesn't work, and is quite subtle, at least for my brain.
There was a discussion in this thread:
So basically he rediscovered Why FP Matters
(http://www.math.chalmers.se/~rjmh/Papers/whyfp.html) ~15-20 years
after the fact, but neglected to point out the interesting fact that
one can write map in terms of reduce (i.e. foldr) (obviously he didn't
read the paper) and ignored the benefits of
Bulat Ziganshin wrote:
Hello Chris,
Wednesday, August 2, 2006, 3:16:58 PM, you wrote:
Announcing: TextRegexLazy version 0.56
your feature list is really strong! it will be great now to make it
a part of GHC standard distribution
afaiu, selection of regex engine implemented via import
I don't think this commentary is really fair. It's also insular and bad for the reputation of the Haskell community. There are enough barriers to exploring FP and Haskell already. The purpose of the article was to encourage people to start taking baby steps toward FP, not to demonstrate a deep
I don't think this commentary is really fair. It's also insular and bad for
the reputation of the Haskell community. There are enough barriers to
exploring FP and Haskell already. The purpose of the article was to
encourage people to start taking baby steps toward FP, not to demonstrate a
deep
He can't take it very far. The whole point is to keep the entire lesson in the space the audience regards as relevant. What you know to be relevant for his audience isn't the same as what his audience knows to be relevant. We are emphatically not the audience for this piece. Notice how he
Chris Kuklewicz wrote:
Announcing: TextRegexLazy version 0.56
Where: Tarball from http://sourceforge.net/projects/lazy-regex
darcs get --partial [--tag=0.56]
http://evenmere.org/~chrisk/trl/stable/ License : BSD, except for
Great! - Thanks for all your hard work in making this available
48 matches
Mail list logo
