#2540: [Text.Regex] incorrect word boundary (\\b) substitutions. Bug in regex-
compat's subRegex handling of BOL flags.
+---
Reporter: Eelis- | Owner: ChrisKuklewicz
Type: bug |
#2541: ghc does call unlit from the right location
-+--
Reporter: judah| Owner: igloo
Type: bug | Status: closed
Priority: normal | Milestone: 6.10.1
Component: Driver |
#2543: Nested SPECIALIZEd functions cause error: Symbol _BadUTF8_zdf1_closure
already defined.
---+
Reporter: judah | Owner:
Type: bug | Status: new
Priority: normal |
#2542: runghc does not infer module file extensions
--+-
Reporter: judah | Owner: igloo
Type: bug | Status: new
Priority: high | Milestone: 6.10.1
Component: Compiler
#2540: [Text.Regex] incorrect word boundary (\\b) substitutions. Bug in regex-
compat's subRegex handling of BOL flags.
+---
Reporter: Eelis- | Owner: ChrisKuklewicz
Type: bug |
#1338: base package breakup
+---
Reporter: simonmar| Owner:
Type: task| Status: new
Priority: normal | Milestone: 6.12 branch
Component:
I am pleased to announce that a new issue of The Monad.Reader is now
available:
http://www.haskell.org/haskellwiki/The_Monad.Reader
Issue 11 consists of the following three articles:
* David F. Place
How to Refold a Map
* Kenneth Knowles
First-Order Logic a la Carte
*
On Sun, Aug 24, 2008 at 7:12 PM, Ashley Yakeley [EMAIL PROTECTED] wrote:
Is there any interest in implementing a top level - to run monadic code?
This is actually implemented in jhc. See the 'top level actions' section of
http://repetae.net/computer/jhc/manual.html
-Edward Kmett
(Moving to Haskell cafe)
Edward Kmett wrote:
On Sun, Aug 24, 2008 at 7:12 PM, Ashley Yakeley [EMAIL PROTECTED] wrote:
Is there any interest in implementing a top level - to run monadic code?
This is actually implemented in jhc. See the 'top level actions' section of
On Mon, Aug 25, 2008 at 04:55:05PM +0100, Adrian Hey wrote:
(Moving to Haskell cafe)
Edward Kmett wrote:
On Sun, Aug 24, 2008 at 7:12 PM, Ashley Yakeley [EMAIL PROTECTED] wrote:
Is there any interest in implementing a top level - to run monadic code?
This is actually implemented in jhc.
On Sun, 24 Aug 2008, Eric Kidd wrote:
Greetings, Haskell folks!
I'm working on a toy program for drum synthesis. This has lead me to
explore the various sound-related libraries in Hackage. Along the way,
I've learned several things:
1. There's a lot of Haskell sound libraries, but no
On Sun, 24 Aug 2008, John Van Enk wrote:
Eric,
I was hoping to use a packed format like ByteString eventually. Right now, I
want to get everything working nicely. As it stands, I end up marshaling a
lot of information into/out of arrays which I'd much rather keep as a block
of memory.
I'm
On Sun 2008-08-24 11:03, Thomas M. DuBuisson wrote:
Yay, the multicore version pays off when the workload is non-trivial.
CPU utilization is still rather low for the -N2 case (70%). I think the
Haskell threads have an affinity for certain OS threads (and thus a
CPU). Perhaps it results in a
I am pleased to announce that a new issue of The Monad.Reader is now
available:
http://www.haskell.org/haskellwiki/The_Monad.Reader
Issue 11 consists of the following three articles:
* David F. Place
How to Refold a Map
* Kenneth Knowles
First-Order Logic a la Carte
*
Hi,
I'm trying to make a syntax reference in the form
of source code. It's not ready, but if someone
shares the same ideas I could use some
help. (Should I put this on a wiki? Where?)
My “design principles” are:
• It should contain just pieces of uncommented
code. The idea is not to use it
Maurício wrote:
• It should show the complete syntax of
everything, not the most common. For instance,
‘case of’ should show the use of guards;
• It should be an example of valid code, not good
one. The idea is to show what can be done, not
what should :)
This can help you when you
On Mon, 2008-08-25 at 00:33 +0200, Ben Franksen wrote:
Hans van Thiel wrote:
so 'The Greenhorn's Guide to becoming a Monad Cowboy' is on
http://www.muitovar.com/monad/moncow.xhtml
Forgot to say: nicely written!
Some more comments:
You can declare a fixity (infixr) for flop instead
I've had an interested user, who tried to get one of my programs to
run on a Debian machine - running Debian Etch, released a couple of
months ago. Here are some of the hurdles stumbled upon in the
process:
1. Etch comes with ghc-6.6, and that didn't work with my .cabal file.
2. ghc-6.8.3,
Maurício wrote:
• It should be an example of valid code, not good
one. The idea is to show what can be done, not
what should :)
then put lots of semicolons somewhere: while they are at
minimum a separator, it's generally allowed to insert as
many extra semicolons as you want at the
Ketil Malde wrote:
I've had an interested user, who tried to get one of my programs to
run on a Debian machine - running Debian Etch, released a couple of
months ago.
Your user is pretty much at the pessimal point in the release cycle.
Etch is more than a year old, and lenny (the next
(Moving to Haskell cafe)
Edward Kmett wrote:
On Sun, Aug 24, 2008 at 7:12 PM, Ashley Yakeley [EMAIL PROTECTED] wrote:
Is there any interest in implementing a top level - to run monadic code?
This is actually implemented in jhc. See the 'top level actions' section of
i tried to install wxGeneric and need syb-with-class.
i got the package from hackage.
configure runs fine, but when i build i get:
Data/Generics/SYB/WithClass/Instances.hs:11:7:
Could not find module `Data.Array':
it is a member of package array-0.1.0.0, which is hidden
but
Hi
Ketil Malde wrote:
I've had an interested user, who tried to get one of my programs to
run on a Debian machine - running Debian Etch, released a couple of
months ago. Here are some of the hurdles stumbled upon in the
process:
Debian Etch were released in April 8th, 2007. 16 months ago.
Am Montag, 25. August 2008 18:08 schrieb Andrew U. Frank:
i tried to install wxGeneric and need syb-with-class.
i got the package from hackage.
configure runs fine, but when i build i get:
Data/Generics/SYB/WithClass/Instances.hs:11:7:
Could not find module `Data.Array':
it is a
lemming:
On Sun, 24 Aug 2008, John Van Enk wrote:
Eric,
I was hoping to use a packed format like ByteString eventually. Right
now, I
want to get everything working nicely. As it stands, I end up marshaling a
lot of information into/out of arrays which I'd much rather keep as a
block
jed:
On Sun 2008-08-24 11:03, Thomas M. DuBuisson wrote:
Yay, the multicore version pays off when the workload is non-trivial.
CPU utilization is still rather low for the -N2 case (70%). I think the
Haskell threads have an affinity for certain OS threads (and thus a
CPU). Perhaps it
How well would the storablevector package (Data.StorableVector) work for
storing audio data? One of the major issues I'm still working over is that I
want to maintain something similar to a [[a]] format (since the underlying
PortAudio library and hardware could support hundreds of interleaved
That code looks like it ought to work, and I assume if you're using
VBOs that you know how to make sure your frustum is setup so that
you're object's visible. Are you running this in Windows or in Linux
or ? and what version of GHC are you using?
There is also a specific HOpenGL mailinglist,
On Mon, Aug 25, 2008 at 5:33 AM, Hans van Thiel [EMAIL PROTECTED] wrote:
The books I use for reference, the Craft and SOE, don't seem to mention
this. I have to confess, I don't really understand the difference
between newtype and data. Again, an explanation would be appreciated.
A newtype has
Oh, and you might try this using Vertex Arrays instead of VBOs. I'll
also assume you're checking for the appropriate ARB extensions to make
sure VBOs are available on your hardware... If this displays
correctly using Vertex Arrays (which can still be interleaved), then I
would check your
ryani.spam:
On Mon, Aug 25, 2008 at 5:33 AM, Hans van Thiel [EMAIL PROTECTED] wrote:
The books I use for reference, the Craft and SOE, don't seem to mention
this. I have to confess, I don't really understand the difference
between newtype and data. Again, an explanation would be
Christopher Lane Hinson wrote:
Here's an error the Haskell run-time system might throw:
*** Exception: Prelude.head: empty list
(or whatever)
So now what? Action plan = [].
rgrep head .
Lists 17 items for three projects I've been working on summing to
1 lines of haskell. Use
Per the GHC manual section on instance overlap:
If an instance declaration is compiled without
-XOverlappingInstances, then that instance can never be
overlapped. This could perhaps be inconvenient.
It is inconvenient for certain things. If I want to declare a
special `instance
Hans van Thiel wrote:
On Mon, 2008-08-25 at 00:33 +0200, Ben Franksen wrote:
Hans van Thiel wrote:
so 'The Greenhorn's Guide to becoming a Monad Cowboy' is on
http://www.muitovar.com/monad/moncow.xhtml
(Recall that a type definition is just like a data definition, but with
no choice
On Mon, Aug 25, 2008 at 7:54 PM, Niels Aan de Brugh [EMAIL PROTECTED]wrote:
Christopher Lane Hinson wrote:
Here's an error the Haskell run-time system might throw:
*** Exception: Prelude.head: empty list
(or whatever)
So now what? Action plan = [].
rgrep head .
Lists 17 items for
Don Stewart wrote:
ashley:
Thomas Davie wrote:
I'd be interested to see your other examples -- because that error is
not happening in Haskell! You can't argue that Haskell doesn't give you
no segfaults, because you can embed a C segfault within Haskell.
This segfaults on my x86_64 Linux
• It should be an example of valid code, not good
one. The idea is to show what can be done, not
what should :)
then put lots of semicolons somewhere: while they are at minimum a
separator, it's generally allowed to insert as many extra semicolons as
you want at the beginning, end, or
On Aug 25, 2008, at 15:00 , Jason Dusek wrote:
It is inconvenient for certain things. If I want to declare a
special `instance Show [MyType] where...` I am out of luck.
In this particular case, can't you just define showList?
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] [EMAIL
duncan.coutts:
On Thu, 2008-08-14 at 10:21 -0700, Don Stewart wrote:
I think you're right. The Binary instances cannot and must not read more
than they need to, so that gives us the behaviour that we read exactly
the length of the file, but no more, and thus we never hit EOF, so we
Hi, I used VBO with haskell and I remember it being pretty
straightforward, pretty much the same as in C. This was a while ago
and I don't really remember how things work so I can't really comment
on your code. But I'll see if I can find my old haskell VBO code.
On Mon, Aug 25, 2008 at 8:43 PM,
Brandon S. Allbery KF8NH [EMAIL PROTECTED] wrote:
Jason Dusek wrote:
It is inconvenient for certain things. If I want to declare a
special `instance Show [MyType] where...` I am out of luck.
In this particular case, can't you just define showList?
Will GHCi use that automatically?
On Mon, 2008-08-25 at 15:44 -0700, Jason Dusek wrote:
Brandon S. Allbery KF8NH [EMAIL PROTECTED] wrote:
Jason Dusek wrote:
It is inconvenient for certain things. If I want to declare a
special `instance Show [MyType] where...` I am out of luck.
In this particular case, can't you
On Aug 24, 2008, at 8:41 AM, Eric Kidd wrote:
Greetings, Haskell folks!
I'm working on a toy program for drum synthesis. This has lead me to
explore the various sound-related libraries in Hackage. Along the
way,
I've learned several things:
Hey Erik, I've also created (minimal, for fun)
Oh! Thank you -- that turned out to be the right thing. I'm
glad someone thought of this already.
--
_jsn
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'm trying to write a validating XML library.
I'm struggling with implementnig the choice alternative.
Once piece of the code is
Where st is the state representing the subelemnts which may still be
attached to the current element. (Basically some tree containing
Seq, Or, one or more, 0 or more,
Hi,
In Haskell reference, I see the
following definitions:
uniWhite - any Unicode character defined
as whitespace;
uniSmall - any Unicode lowercase letter;
uniLarge - any uppercase or titlecase
Unicode letter;
uniSymbol - any Unicode symbol or
punctuation.
Where do I get lists for those
Hello,
The HList paper (http://homepages.cwi.nl/~ralf/HList/) presents a
reasonable general type level equality (though it requires GHC). The
paper also describes some other implementations including the
interpretation of types as type-level nats.
-Jeff
On Mon, Aug 25, 2008 at 8:11 PM, Marc
You can't determine Unicode character properties by analyzing the
names of the characters.
Read chapter 4 of the standard:
http://www.unicode.org/versions/Unicode5.0.0/ch04.pdf
and get the property values here:
http://www.unicode.org/Public/UNIDATA/DerivedCoreProperties.txt
It sounds like
On Mon, Aug 25, 2008 at 04:55:05PM +0100, Adrian Hey wrote:
(Moving to Haskell cafe)
Edward Kmett wrote:
On Sun, Aug 24, 2008 at 7:12 PM, Ashley Yakeley [EMAIL PROTECTED] wrote:
Is there any interest in implementing a top level - to run monadic code?
This is actually implemented in jhc.
On chapter 4 I see the following
nice table in page 139. Do you think
I can use it together with UnicodeData.txt
to choose valid characters for Haskell?
Here is the only place I found where names
match with haskell syntax reference
(uppercase, lowercase, punctuation, symbol).
Thanks,
Maurício
dons:
Simon Marlow sez:
The thread-ring benchmark needs careful scheduling to get a speedup
on multiple CPUs. I was only able to get a speedup by explicitly
locking half of the ring onto each CPU. You can do this using
GHC.Conc.forkOnIO in GHC 6.8.x, and you'll also need
thomas.dubuisson:
dons:
Simon Marlow sez:
The thread-ring benchmark needs careful scheduling to get a speedup
on multiple CPUs. I was only able to get a speedup by explicitly
locking half of the ring onto each CPU. You can do this using
GHC.Conc.forkOnIO in GHC 6.8.x,
On 26 Aug 2008, at 1:31 pm, Deborah Goldsmith wrote:
You can't determine Unicode character properties by analyzing the
names of the characters.
However, the OP *does* have a copy of the UnicodeData...txt file,
and you *can* determine the relevant Unicode character properties from
that.
No, the general category is not enough. Please read both references.
As you can tell from DerivedCoreProperties.txt, for example:
# Derived Property: Uppercase
# Generated from: Lu + Other_Uppercase
So general category Lu is not the same thing as Uppercase
Deborah
On Aug 25, 2008, at 7:18
All characters with general category Lu have the property Uppercase,
but the converse is not true.
Deborah
On Aug 25, 2008, at 8:27 PM, Richard A. O'Keefe wrote:
On 26 Aug 2008, at 1:31 pm, Deborah Goldsmith wrote:
You can't determine Unicode character properties by analyzing the
names
One may wonder which of them was used
in Haskell compilers. Did they take
only Lu characters, or were they
carefull to accept all Uppercase?
Maurício
Deborah Goldsmith a écrit :
All characters with general category Lu have the property Uppercase, but
the converse is not true.
Deborah
On Aug
On 26 Aug 2008, at 3:42 pm, Deborah Goldsmith wrote:
All characters with general category Lu have the property Uppercase,
but the converse is not true.
It depends on what the OP wants to do with the information.
For example, Unicode Standard Annex 31,
Hi,
Is it allowed to write two
different modules in a single
file? Something like:
module Mod1 (...) where {
...
}
module Mod2 (...) where {
import Mod1;
...
}
I tried, and got an error,
but would like to confirm
that there's no way to do
that.
Thanks,
Maurício
2008/8/26 Deborah Goldsmith [EMAIL PROTECTED]:
It sounds like the properties you want are Case and General Category.
Maybe the spec should be more explicit on exactly how the definitions map
onto Unicode properties, so there is no ambiguity.
This is proposed for Haskell'.
John Meacham wrote:
... if ACIO is well defined which I think it is.
Affine: ma mb = mb
Central:
do {a - ma;b - mb;return (a,b)} = do {b - mb;a - ma;return (a,b)}
...for some concept of =.
Is this correct? Are there any other constraints?
___
60 matches
Mail list logo
