#737: Pattern match failure in coreSyn/CoreUtils.lhs
--+-
Reporter: ekarttun@cs.helsinki.fi | Owner:
Type: bug | Status: closed
Priority: normal
#745: GHC should recover better from bad type signatures
-+--
Reporter: simonpj |Owner: simonpj
Type: bug | Status: new
Priority: low |Milestone:
Component:
I'm sorry I've been slow in replying to this.
Short summary: your program has a bug, but GHC still should not crash.
The bug is that you extracted the Name of the *type constructor* (,,) from the
type of 'x, but you then used it as a *data constructor* in the pattern.
Solution: when you have
Thank you for the bug report. It certainly is a bug. I'm fixing it now.
Sadly, I've missed the boat for GHC 6.4.2, but the fix will be in the HEAD, and
in the next release.
Simon
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:glasgow-haskell-bugs-
| [EMAIL PROTECTED] On
Were always on the lookout for
some Cygwin-savvy person to do this. There should be nothing difficult in
principle, but probably quite a lot of delicate details like fixing backslash
directions.
Simon
Also, any ideas how difficult a Cygwin port of GHC
would be? Tips would be
I was just musing the other day about the possibility of allowing
(efficient and transparent) destructive updates in certain situations.
Take the following (giberish) example:
f xs = g xs []
where g [] ac = ac
g (x1:x2:xs) ac = g xs (ac ++ [x2,x1])
It seems to me that the list
I am interested in better understanding what optimizations of this
sort GHC performs. I second Lajos's question.
I sometimes write code using StateMonad, and expect some destructive
updates. Judging by the performance of the resulting executable, the
updates are nondestructive. (But,
On Apr 14, 2006, at 12:25 PM, Lajos Nagy wrote:
I was just musing the other day about the possibility of allowing
(efficient and transparent) destructive updates in certain
situations. Take the following (giberish) example:
f xs = g xs []
where g [] ac = ac
g (x1:x2:xs) ac = g
On Thu, Apr 13, 2006 at 04:24:45PM +0100, Simon Marlow wrote:
- get an implementation of this in GHC which computes the same results
for all platforms?
I would certainly hope so, if we can find the source of the discrepancy
and devise a fix.
I'd just point out that C compilers don't allow
This looks very interesting! I must try and find time to look at at. MACID
sounds like a really powerful idea...
#g
--
Einar Karttunen wrote:
Hello,
HAppS - Haskell Application Server version 0.8 has been released and
contains a complete rewrite of the ACID and HTTP functionalities.
Yeah, I think it boils down to different representations of NaN on
different platform. I guess I forgot to test for NaN when I wrote
(the C code for) decodeFloat. It should generate some consistent
result.
On the other hand, if you have code that possible divides by 0
and don't check for it,
An index-aware linear algebra library in Haskell
I've been exploring the implementation of a library for linear
algebra, i.e. manipulating vectors and matrices and so forth, which
has as a fundamental design goal the exposure of index types and
ranges to the type system so that operand
I don't know if it would help, but PLT Scheme has been thru this and
Matthew Flatt has a nice test suite that you can see here:
http://svn.plt-scheme.org/plt/trunk/collects/tests/mzscheme/number.ss
To help read the code, when you see something like:
(test a b c ...)
that is the same thing
Koen Claessen (Wed, Apr 12, 2006 at 11:06:50AM +0200):
There is currently an old QuickCheck version in the standard hierarchy
in Test.QuickCheck. As the new QuickCheck is incompatible with the old
one, I do not want to override that place. Rather, I would like to
create my own little space in
Good summary. I have made a few edits mainly to clarify what (I think)
is being said.
Under cooperative or preemptive concurrency I'd like someone two write
down as precisely as possible what it means to say the spec requires
cooperative concurrency or the spec requires preemptive concurrency.
I've never used that Runtime Loader package but I have gotten
hs-plugins to work:
http://www.cse.unsw.edu.au/~dons/hs-plugins/
Hope that helps,
Jared.
On 4/13/06, Tim Newsham [EMAIL PROTECTED] wrote:
Hi,
I'm about to start playing with HWS-WP (web server + plugins). It
relies on
Triggered by your msg, I've added a link to hs-plugins from GHC's
user-documentation page
http://haskell.org/haskellwiki/GHC/Documentation
It's a Wiki page with a specific section for collaborative
documentation; please add more material.
Simon
| -Original Message-
| From:
I believe if you change the representation of puzzles from [(pos,range)]
to an Array, you'll get a significant speedup
yet because I only recently removed a logic bug that slowed down the
search instead of speading it up; ..). so the more interesting bit is
that our solvers disagree on which
I need a Linux ghc 6.2.1 built with glibc-2.4. The existing 6.2.1 RPM,
built with glibc-2.3, works mostly OK, but with some programs, the
generated executables barf and die on startup.
Any suggestions on how to create such a beast?
I've tried using ghc 6.4.1, for which there's a Fedora 5 RPM,
19 matches
Mail list logo
