#149: missed CSE opportunity
--+-
Reporter: nobody| Owner:
Type: run-time performance bug | Status: new
Priority: normal|
#1890: Regression in mandelbrot benchmark due to inlining
--+-
Reporter: dons | Owner:
Type: run-time performance bug | Status: closed
Priority: high
#594: Support use of SSE2 in the x86 native code genreator
+---
Reporter: simonmar| Owner:
Type: task| Status: new
Priority: normal |
#2014: getLinkDeps panic
--+-
Reporter: fons | Owner:
Type: bug | Status: new
Priority: high | Milestone: 6.8.3
Component: Compiler |Version: 6.8.2
#1791: heap overflow should generate an exception
-+--
Reporter: guest| Owner:
Type: feature request | Status: new
Priority: normal | Milestone:
#1992: 6.8.2 intermittent build failure on multiple OS X versions
--+-
Reporter: guest | Owner:
Type: bug | Status: new
Priority: normal| Milestone: 6.8.3
#2088: GHC messages do not reflect argument name changes
---+
Reporter: sethkurtzberg | Owner: igloo
Type: bug| Status: new
Priority: normal | Milestone:
#2087: On a PPC Mac OS X 10.4, the RTS reports Memory leak detected running a
program compiled with -debug -threaded -fhpc
+---
Reporter: thorkilnaur | Owner: simonmar
Type: bug |
#2099: Storable instance for Complex
+---
Reporter: jedbrown| Owner:
Type: proposal| Status: new
Priority: normal | Milestone: Not GHC
Component:
#1984: weird performance drop with -O2 on x86
--+-
Reporter: guest | Owner:
Type: bug | Status: closed
Priority: normal| Milestone: 6.8 branch
Component:
#1589: Process creation and communication doesn't scale linearly
+---
Reporter: guest | Owner: simonmar
Type: bug | Status: new
Priority: normal
#2098: validate fails for PPC Mac OS X 10.4
-+--
Reporter: thorkilnaur | Owner: simonmar
Type: bug | Status: new
Priority: highest | Milestone: 6.10 branch
#2105: garbage collection confusing in ghci for foreign objects
--+-
Reporter: Frederik | Owner:
Type: run-time performance bug | Status: new
Priority: normal
#2105: garbage collection confusing in ghci for foreign objects
--+-
Reporter: Frederik | Owner:
Type: run-time performance bug | Status: closed
Priority: normal
#1544: Derived Read instances for recursive datatypes with infix constructors
are
too inefficient
--+-
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
#2099: Storable instance for Complex
+---
Reporter: jedbrown| Owner:
Type: proposal| Status: new
Priority: normal | Milestone: Not GHC
Component:
#2099: Storable instance for Complex
+---
Reporter: jedbrown| Owner:
Type: proposal| Status: new
Priority: normal | Milestone: Not GHC
Component:
#2110: Rules to eliminate casted id's
+---
Reporter: igloo| Owner:
Type: feature request | Status: new
Priority: normal | Milestone: 6.10 branch
#2111: Incorrect arrow rec {} notation crashes in ghci
---+
Reporter: luqui | Owner:
Type: bug | Status: new
Priority: normal | Component: Compiler
Version: 6.8.1
#2071: hp2ps does not handle SCCs with spaces in the identifiers
---+
Reporter: benl | Owner:
Type: bug| Status: new
Priority: normal | Milestone: 6.8.3
#2064: problems with duplicate modules
--+-
Reporter: Frederik | Owner:
Type: bug | Status: new
Priority: normal| Milestone: 6.8 branch
Component: Compiler |
Hello everyone,
I am just learning to program in Haskell, and I found recursion very
interesting.
However, I need to write a recursive function over two lists.
The function must check the elements in the two lists and return an
element that is common to both lists if there is any.
Any
Sean Leather:
I tried to build GHC stable on my two computers, a PowerBook G4 and
a MacBook, both running 10.5.2. This is the first time I've ever
tried, so I'm somewhat clueless about a lot of it. I went with the
basic instructions (./configure; make) with no 'mk/build.mk' and no
configure
On Mon, 18 Feb 2008, TOPE KAREM wrote:
Hello everyone,
I am just learning to program in Haskell, and I found recursion very
interesting.
However, I need to write a recursive function over two lists.
The function must check the elements in the two lists and return an
element that is
Hi,
Manuel M T Chakravarty:
I can't help you with the PPC, but on the MacBook try building with
make EXTRA_AR_ARGS=-s
It's a known bug with Cabal.
Thanks, Manuel, it builds now.
Afterwards, I ran 'make' in 'testsuite/tests/ghc-regress' and got this:
OVERALL SUMMARY for test run started
On Mon, Feb 18, 2008 at 12:46:19PM -0600, Carlos Gomez A. wrote:
hi, my name is carlos
I need information for correct installor
what are dependencies on ghc ?
I have a Debian System.
I have this message error to install the ghc:
Debian-System/haskell/ghc-6.8.2# ./configure
Sean Leather:
Manuel M T Chakravarty:
I can't help you with the PPC, but on the MacBook try building with
make EXTRA_AR_ARGS=-s
It's a known bug with Cabal.
Thanks, Manuel, it builds now.
Afterwards, I ran 'make' in 'testsuite/tests/ghc-regress' and got
this:
OVERALL SUMMARY for test
SecReT 2008
3rd International Workshop on
Security and Rewriting Techniques
http://www.dsic.upv.es/workshops/secret08
Funding is available for the following PhD studentships within
the TCS group at the University of Kent. Applicants should contact the
project supervisor directly for further details.
Project Supervisor: Dr Olaf Chitil ([EMAIL PROTECTED])
Project Title: Tracing Functional Programs with Hat
Hat
[I replied on @cafe but didn't get any response. Trying again here.]
Barney Hilken wrote:
What about just implementing the cheapest solution that still gets
us most
of the way?
(3) If it is as cheap (to implement) as advertised then there is no
great
risk involved. If it turns out the
Begin forwarded message:
From: Ben Franksen [EMAIL PROTECTED]
Date: 18 February 2008 21:32:29 GMT
To: haskell@haskell.org
Could you be more specific? Which proposals exactly do you mean and
where
can I read more about them?
Hlist is one of the ones | was thinking of. Two more are poor
Good point. Happily I improved the error message a couple of weeks ago, so
it'll be better in the next release
Simon
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Daniel Fischer
| Sent: 08 February 2008 22:24
| To: Ben Franksen;
On Sun, Feb 17, 2008 at 10:01:14PM +, Adrian Hey wrote:
Philip Armstrong wrote:
Since no-one else has answered, I'll take a stab.
Obiously, you have a stack leak due to laziness somewhere
I wouldn't say that was obvious, though it is certainly a
possibility.
I'm never exactly clear what
On Sun, Feb 17, 2008 at 11:45:26PM +, Adrian Hey wrote:
But I guess this rant is not much help to the OP :-)
Can the Get Monad from Data.Binary be replaced by the one in
Data.Binary.Strict.Get?
Would probably require some hacking on the library I guess.
Phil
--
http://www.kantaka.co.uk/
Don Stewart wrote:
Perhaps we should get a binding to tzset in the unix library?
That's probably preferable to calling tzset() before every localtime_r.
But perhaps we want a call that combines the putenv and the tzset, just
so it exposes fewer implementation details.
This is essentially
On Mon, 18 Feb 2008, Stuart Cook wrote:
A while ago I wrote a little data structure that allows weighted
random selection-without-replacement from a collection of values in
O(log n) time.[1] I'm now in the process of packaging it up for
Hackage, but I'm looking for good names for both the
On Sun, 17 Feb 2008, Philippa Cowderoy wrote:
The nicest use would be for converting between a more specific error type
and a more general one that handles a wider range of errors - enabling us
to keep tighter track of which errors are possible in a given piece of
code. Bonus points for
On Feb 18, 2008 5:11 AM, Stuart Cook [EMAIL PROTECTED] wrote:
A while ago I wrote a little data structure that allows weighted
random selection-without-replacement from a collection of values in
O(log n) time.[1] I'm now in the process of packaging it up for
Hackage, but I'm looking for good
On Mon, 2008-02-18 at 11:37 +, Luke Palmer wrote:
On Feb 18, 2008 5:11 AM, Stuart Cook [EMAIL PROTECTED] wrote:
A while ago I wrote a little data structure that allows weighted
random selection-without-replacement from a collection of values in
O(log n) time.[1] I'm now in the process
Philip Armstrong wrote:
On Sun, Feb 17, 2008 at 10:01:14PM +, Adrian Hey wrote:
Philip Armstrong wrote:
Since no-one else has answered, I'll take a stab.
Obiously, you have a stack leak due to laziness somewhere
I wouldn't say that was obvious, though it is certainly a
possibility.
Bryan O'Sullivan wrote:
Stefan O'Rear wrote:
I'll bet that breaks horribly in the not-so-corner case of /dev/tty.
Actually, it doesn't. It seems to do a read behind the scenes if the
buffer is empty, so it blocks until you type something.
Indeed, and this is why even an unbuffered Handle
Hi everyone,
This is regarding Thrift, a software framework for scalable
cross-language services development(1)
Present in the release tarball there is some source for Haskell but no
sign of a tutorial or any sample code. I'm just picking through but as
a long shot does anyone have examples they
Philip Armstrong wrote:
On Sun, Feb 17, 2008 at 10:01:14PM +, Adrian Hey wrote:
BTW, I find this especially ironic as fromDistinctAscList is the perfect
example what I was talking about in another thread (continuation passing
madness caused by an irrational fear of stack use).
In *some*
Wilhelm B. Kloke wrote:
Ben Franksen [EMAIL PROTECTED] schrieb:
Wilhelm B. Kloke wrote:
[EMAIL PROTECTED] [EMAIL PROTECTED] schrieb:
I would consider a good idea if ghc would provide language support to
this sort of integers.
No need, you can do that for yourself:
{-# LANGUAGE
On Mon, Feb 18, 2008 at 05:56:41PM +, Adrian Hey wrote:
Philip Armstrong wrote:
On Sun, Feb 17, 2008 at 10:01:14PM +, Adrian Hey wrote:
BTW, I find this especially ironic as fromDistinctAscList is the perfect
example what I was talking about in another thread (continuation passing
On Sun, Feb 17, 2008 at 10:37 PM, Tom Davies [EMAIL PROTECTED] wrote:
Are there generally accepted English language names for the arrow
combinators?
compose?
Well, compose usually means something with type (a c d - a b c - a b d),
but () has the dual type (a b c - a c d - a b d). So it's
Stuart Cook scook0 at gmail.com writes:
The name I have at the moment is Pool, which I'm reasonably happy
with, but I wanted to see if I could find anything better. Asking on
#haskell got me a few responses:
...
Any suggestions?
How about Tombola?
Brett
Brandon S. Allbery KF8NH wrote:
some platforms require tzset() to recognize timezone changes.
I think it is something like - POSIX requires the tzset()
call, but in ANSI C 98 there is no tzset() and localtime()
always rechecks TZ automatically. Right?
In the man page on Mac OS X Tiger (Darwin
Can I specify an equality constraint in the build-depends field of a
.cabal file? This would say that I want one specific version (because
all the rest of my packages are compiled against that version and I'm
getting type-checking errors trying to install the new package).
neither
Michał Pałka wrote:
On Mon, 2008-02-18 at 11:37 +, Luke Palmer wrote:
On Feb 18, 2008 5:11 AM, Stuart Cook [EMAIL PROTECTED] wrote:
A while ago I wrote a little data structure that allows weighted
random selection-without-replacement from a collection of values in
O(log n) time.[1] I'm now
On Tue, Feb 19, 2008 at 1:27 PM, Isaac Dupree [EMAIL PROTECTED] wrote:
the without replacement thing is more specific. Although maybe the
design could accomodate selection-with-replacement in the same package too
Once you have without-replacement, with-replacement is easy: just
re-use the old
51 matches
Mail list logo
