Bugs item #766386, was opened at 2003-07-05 16:20
Message generated for change (Comment added) made by simonmar
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=766386group_id=8032
Category: Compiler
Group: 6.0
Status: Closed
Resolution: Fixed
Priority: 5
In article [EMAIL PROTECTED],
I wrote:
$ ghc -fno-implicit-prelude -prof -c M.hs
/tmp/ghc4124.hc:5: `NULL' undeclared here (not in a function)
/tmp/ghc4124.hc:5: initializer element is not constant
/tmp/ghc4124.hc:5: (near initialization for `M_CAFs_cc_ccs[0].prevStack')
/tmp/ghc4124.hc:5:
Trouble is, GHC does not distinguish specialisation rules in any way.
-fno-specialisation says not to *generate* any specialisation rules;
-frules-off says not to *apply* any rules.
I suppose you are distinguishing specialisation rules by their name --
whether they start SPEC That'll work,
On Mac OS X GHCi 6.0 complains about a missing symbol when trying to
load package util. Wolgang Thaller told me the cause of this bug:
The problem was that there was a file called HsReadline.c. The
corresponding
object file, HsReadline.o, replaced HSreadline.o on the Mac's
case-insensitive file
In article [EMAIL PROTECTED],
I wrote:
$ ghc -fno-implicit-prelude -prof -c M.hs
/tmp/ghc4124.hc:5: `NULL' undeclared here (not in a function)
/tmp/ghc4124.hc:5: initializer element is not constant
/tmp/ghc4124.hc:5: (near initialization for
`M_CAFs_cc_ccs[0].prevStack')
Not quite sure what you mean by case eta expansion.
Eta expansion is certainly still done, but only on 'let'
right-hand-sides, by SimplUtils.tryEtaExpansion.
Simon
| -Original Message-
| From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED]
| On Behalf Of David Sabel
| Sent: 18 July 2003
(Your caps-lock key seems to be stuck :-)
You should give more information, like the error messages you received. Did
the installation of Wash etc complete successfully? Did the example programs
compile? (They will produce exes.)
I recently (2-3 weeks ago) downloaded Wash and installed it on a
- Original Message -
From: Simon Peyton-Jones [EMAIL PROTECTED]
To: David Sabel [EMAIL PROTECTED];
[EMAIL PROTECTED]
Sent: Monday, July 21, 2003 9:53 AM
Subject: RE: case-eta-expansion
Not quite sure what you mean by case eta expansion.
I mean this transformation:
case e of {p1 -
Sean Seefried [EMAIL PROTECTED] wrote:
Dear GHC users on the Mac,
I'm addressing this primarily to Wolfgang but also to anyone who
has built GHC HEAD successfully on Mac OS X.
I'm having difficulty doing it myself and I was just wondering if someone
could put together a small set of instructions
Mere overload resolution (over monomorphic types) is not NP-hard. (This
is only a common misconception.)
I can only repeat my above sentence.
No, but as you note below, the interesting cases are. Most
of the more interesting number-like types are polymorphic (e.g.
Complex, Ratio).
This kind of
This seems to be a frequently requested feature of Haskell: the ability
to declare default members in a superclass for a particular class.
Here's an example:
class Functor f where
fmap :: (a - b) - f a - f b
class (Functor f) = Monad f where
...
The idea is that it should be
On Mon, Jul 21, 2003 at 06:21:33AM -0700, Ashley Yakeley wrote:
Well I don't doubt this would be a very useful extension to the Haskell
language: indeed it would eliminate code in all my Haskell projects. But
before we can propose this, we have to work out what the syntax would
look like.
Announcement: wxHaskell 0.1
---
http://wxhaskell.sourceforge.net
wxHaskell is a new portable GUI library for Haskell. The goal of the
project is to provide an industrial strength portable GUI library, but
without the burden of developing (and maintaining) one ourselves.
G'day all.
On Mon, Jul 21, 2003 at 01:07:39PM +0200, Christian Maeder wrote:
Mere overload resolution (over monomorphic types) is not NP-hard. (This
is only a common misconception.)
I can only repeat my above sentence.
I'm a firm believer in the maxim that the best way to find information
There's a 'powerset' thread on this list [1][2] starting 4th June which I
think contains some of the answers you seek. Read and you shall learn!
#g
--
[1] List archive: http://www.haskell.org/pipermail/haskell-cafe/
[2] Powerset thread
starts:
Hi everyone,
I have written the following program to find magic numbers i.e. integers 'n' such
that both (n+1) and (n/2+1) are perfect squares.
-- Program to find magic numbers
Import IO
main :: IO ()
main =
do
print (filter magicP sqs)
sqs :: [Int]
sqs = [x*x | x -
I've managed to get a segfault in haskell! And without even using the
FFI... actually my code uses the FFI, but the changes that triggered the
segfault don't involve that, they just use Text.Regex.
The code that triggers the segfault is the function produced by:
filetype_function :: IO (FilePath
Trying to get the hang of exceptions...
I would expect this program:
module Main where
import Control.Exception hiding (GHC.Prelude.catch)
temp :: IO ()
temp = do
putStrLn line 1
ioError (AssertionFailed my temp)
handler :: Exception - IO ()
handler e = putStrLn (exception: ++
On Mon, Jul 21, 2003 at 02:12:02PM +0100, Bayley, Alistair wrote:
module Main where
import Control.Exception hiding (GHC.Prelude.catch)
This hiding clause is illegal. But anyway what you want is
import Prelude hiding (catch)
import Control.Exception
Prelude.catch only catches Haskell 98
If I try to run the program (compiled using GHC 6), it calculates all
members of the list and then prints the whole list in the end. Since
Haskell is 'lazy' I was expecting behaviour similar to HUGS where it prints
the numbers as it finds them. Does this behaviour have something to do with
I'm looking for a way to return an arbitrary exit code to the OS. The
standard `exitWith' function does the job, but unfortunately it also has
the side-effect of reporting an exception (I'm using GHC 6.0, with
Control.Exception imported for other purposes).
When a fatal error occurs, my program
21 matches
Mail list logo
