#962: hptRules crash
--+-
Reporter: guest | Owner:
Type: bug | Status: new
Priority: normal| Milestone: 6.6.1
Component: Compiler |Version: 6.6
#1005: Add Logical Shift Operators
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: proposal| Status: new
Priority: normal | Milestone:
Component:
#1005: Add Logical Shift Operators
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: proposal| Status: new
Priority: normal | Milestone:
Component:
#1005: Add Logical Shift Operators
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: proposal| Status: new
Priority: normal | Milestone:
Component:
#1005: Add Logical Shift Operators
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: proposal| Status: new
Priority: normal | Milestone:
Component:
#1006: 'impossible' happened in reportNoInstance?
+---
Reporter: SamB | Owner:
Type: bug | Status: new
Priority: normal |
#1002: ghc-6.6 sometimes hangs under Solaris
---+
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug| Status: new
Priority: normal | Milestone:
#1007: Add parsing (and some more) to the time package
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: proposal | Status: new
Priority: normal |
#993: threaded RTS under pc-solaris does not work
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority: normal | Milestone: 6.6.1
#1004: ghci-6.6 crash on MacOS X
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority: normal | Milestone: 6.6.1
Hello GHC,
Thursday, November 16, 2006, 4:47:02 PM, you wrote:
But last night my ghc-6.6 job hung around for about 2 hours but continued.
real122m20.462s
user5m49.133s
sys 0m20.322s
my unix knowledge is far from perfect, but may be these times means swap
trashing?
--
#1005: Add Logical Shift Operators
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: proposal| Status: new
Priority: normal | Milestone:
Component:
On Wed, Nov 15, 2006 at 01:20:43PM +0100, Jan Christiansen wrote:
I want to use a rank 2 data type and end up in typ problems that I
don't understand. I would really appreciate any hints to the
presented cases or pointers to interesting papers that address the
background of these
Simon Marlow schrieb:
Christian Maeder wrote:
The test files cc004.hs and ffi012.hs failed with several messages of
the form:
calling convention not supported on this architecture: stdcall
When checking declaration:
foreign import stdcall safe wrapper
wrap_f ::
This is a long-standing oddity. I have investigated it at least twice, and
found out what is going on. Each time I do so, I think it's not important
enough to fix today... and before I know it I've forgotten what the problem is
again.
I must write it down! Anyway, it happens on all
also tests/ghc-regress/programs/okeefe_neural is too big to simply fail
with:
Compile failed (status 256) errors were:
ghc-6.6: unknown package: lang
Christian
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
There are some notes on the Wiki:
http://hackage.haskell.org/trac/ghc/wiki/X86OSXGhc
that may be relevant.
I know there are problems with the Intel binary distribution for
OpenGL, but the PPC distribution should work...
Deborah
On Nov 15, 2006, at 6:39 PM, Melissa Chase wrote:
I
On 11/12/06, I wrote:
The following class declaration worked in GHC 6.4.
I recently upgraded to 6.6 (following Debian), and
now it is broken.
class Error e = Game b mv e | b - mv e where
newBoard :: MonadState b m = m ()
...
Hmm, following up on Simon Peyton-Jones' recent
announcement of
Johannes Waldmann wrote:
What methods and tools are there for i18n of Haskell programs?
(I.e. I want output in several languages,
with the language configurable at runtime,
and I want to add languages without recompilation.)
a typical source text (for my application) is here
Don't knock it! Using a functional language helped you to think about the
problem in a new way, and throw together a prototype that worked in a short
enough time that you actually did it. A merit of fp is, I think, that you can
explore the algorithm design space much more quickly -- and
Aditya Siram [EMAIL PROTECTED] wrote:
I have been trying to install Hat for the last couple of days but GHC
does not recognize it as a package. I compiled 2.05 from source, but
at the 'make install' step I see this error message:
Installing hat package for ghc under
In #haskell on freenode we had a discussion about isPrefixOf, which is
probably implemented roughly as so:
isPrefixOf [] _ = True
isPrefixOf _ [] = False
isPrefixOf (x:xs) (y:ys) = x == y isPrefixOf xs ys
Well, this is basically just a zip with a special base case. But you
can't just write it
Hi
Maybe this is not the best place to post this question, but here a lot of
people will see and can direct me to the right place.
I'm using Linux Slackware 10.2 and 11.0, GHC 6.2 and wxWidgets 2.6.X, 2.7.x
I have already tried all kind of combinations but never worked.
I tried: GHC 6.2 ,
On 16 nov 2006, at 11.46, Jason Dagit wrote:
In #haskell on freenode we had a discussion about isPrefixOf, which is
probably implemented roughly as so:
isPrefixOf [] _ = True
isPrefixOf _ [] = False
isPrefixOf (x:xs) (y:ys) = x == y isPrefixOf xs ys
Well, this is basically just a zip with a
Bulat Ziganshin bulat.ziganshin at gmail.com writes:
Hello haskell-cafe,
afaik, there are just two good enough libs - wxHaskell and GtkHs. can
anyone point (or write) detailed comparison of their features? i plan
to write large GUI program in Haskell and want to select best one.
Putting
Hi all,
When I try to compile the following in GHC (v 6.6) (with
-fno-monomorphism-restriction -fimplicit-params)
class Configuration a where
thestring:: a - String
foo c = let { ?c = c } in bar
bar = thestring ?c
I get:
Ambiguous type variable `a' in the constraint:
`Configuration a'
On Wed, 15 Nov 2006 [EMAIL PROTECTED] wrote:
...
I'd be quite happy seeing fromJust removed from the standard
libraries, or at least tagged `deprecated' or with the stigma
attached that is rightfully accorded to unsafePerformIO.
However, unsafe* functions are still recommended by Haskell
On 16/11/06, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
And if we are absolutely positive that the value is (Just x),
we can always write
maybe (assert False undefined) id v
It should be pointed out that Data.Maybe does export a less well-known
function, fromMaybe:
fromMaybe z = maybe
Jason Dagit [EMAIL PROTECTED] writes:
Well, this is basically just a zip with a special base case. But you
can't just write it with zipWith because zipWith stops when it exausts
either list.
How about we define zipWith'' like this:
zipWith'' _ [] _ l _ = [l]
zipWith'' _ _
ke, 2006-11-15 kello 13:31 -0800, Greg Buchholz kirjoitti:
isto wrote:
] let t = show (typeOf a)
] in case t of
] Double - roundDDec d a
] Complex Double - roundCDec d a
Maybe you want type classes instead?
yes, I was blind... Thanks!
I'll guess
isto wrote:
] isto wrote:
] ] let t = show (typeOf a)
] ] in case t of
] ] Double - roundDDec d a
] ] Complex Double - roundCDec d a
]
] I'll guess the reason it didn't compile was different
] types at case branches (am I wrong?)
Correct.
] Anyhow, do you know
On 11/16/06, Eric Willigers [EMAIL PROTECTED] wrote:
Bulat Ziganshin bulat.ziganshin at gmail.com writes:
Hello haskell-cafe,
afaik, there are just two good enough libs - wxHaskell and GtkHs. can
anyone point (or write) detailed comparison of their features? i plan
to write large GUI
If anyone is interested, the solution to my problem was to use a type
synonym instead of an isomorphism class.
Pros:
- Not susceptible to the functional dependencies/overlapping
instances/open-world issue
- Very simple (in fact that simplicity migrated into the rest of the system)
Cons:
-
I'm sharing what I think is a novel extension of TypeEq. Please
1) cope with my introduction of the motivating problem
2) inform me if something similar has already been presented
3) criticize the solution
This presentation is quite a simplification of my actual problem/code,
but I'm trying to
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hello fellow squashy,
Sorry I cannot provide any software references for you, but I have had
similar thoughts to yourself. In particular, I keep a track of my win
rate for one of the competitions I play in - but I do this manually.
Each time I do, I
dmhouse:
On 16/11/06, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
And if we are absolutely positive that the value is (Just x),
we can always write
maybe (assert False undefined) id v
It should be pointed out that Data.Maybe does export a less well-known
function, fromMaybe:
dons:
dmhouse:
On 16/11/06, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
And if we are absolutely positive that the value is (Just x),
we can always write
maybe (assert False undefined) id v
It should be pointed out that Data.Maybe does export a less well-known
function,
As long as we are doing this, perhaps we should also discourage the
use of (head list)?
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Fri, 17 Nov 2006, Donald Bruce Stewart wrote:
dons:
dmhouse:
On
38 matches
Mail list logo
