On Mon, Oct 01, 2001 at 10:52:32AM +0100, Simon Marlow wrote:
This is a known bug, but thanks for reporting it anyway.
The workaround
is as suggested, try compiling with -O.
I *was* compiling with -O. IIRC the problem occured with
any level of
optimisation I tried if
| Changing
| #define BLOCK_SIZE 0x1000
| to
| #define BLOCK_SIZE 0x2000
| in there and rebuilding produced a build which produces code that
| segfaults.
|
| Ah, I forgot to mention you need to adjust BLOCK_SHIFT
| accordingly (on the next line). Changing it from 12 to 13
| should
Hi,
I noticed a difference in behavior between running:
ghci -package utils
And:
ghci
...
Prelude :set -package utils
On our system, the first one works (it finds all the right
dynamic libraries and stuff), but the second one doesn't (it
cannot find libreadline.so, and other
¤»¤d¤»¦Ê¸Uµ§¥þ¥@¬É³Ì·sEmail¦W³æ
§Ú¦³¤»¤d¤»¦Ê¸Uµ§¥þ¥@¬É³Ì·sEmail¦W³æ¡A
§A¥i¥H¦bªá¶O·¥¤Öªº±¡§Î¤U¡A±µÄ²¨ì¥þ¥@¬É¤»¤d¤»¦Ê¸U¤H¡I
³o¨Ç³£¬O³Ì·sªº¦a§}¡A¬O§Ú¦bºô¸ô¤W¡A¦³¨t²Î¦a¦¬¶°¤U¨Óªº¡A
¸g¹L³nÅé´ú¸Õ¡A¥u«O¯d¦³®Ä¦a§}¡A¨ÃºÉ¶q§â¤£Ä@¦¬«HªÌ±Æ°£¡C
I don't think the native ld on alpha-dec-osf3 supports such a feature,
so we would (I assume) have to leave -split-objs in ghc even if we do
implement -ffunction-sections/-fdata-sections. (Would it just be a
matter of enabling it when invoking gcc? Would I be able to try it on
my
Hi,
For a change, a teacher asking for help on behalf of a student
I have a student who wants to emulate S-expressions of Lisp in Haskell. He
came up with the following data type:
data LispList t = Atom t | LispList [LispList t] | Str [Char]
This works just fine. He then wanted to make it
This problem is probably caused by the unbound type variable in
values like (Str HEJ).
Try giving a specific type as the parameter to LispList:
(Str HEJ :: LispList Int)
The error message here could me more informative!
John
___
Haskell mailing
Interesting. The difficulty (which GHCi has too) is this. Consider
expr = Str foo
msg = show expr
Hugs wants to print msg. What are the types?
expr :: forall a. LispList a
msg :: forall a. Show a = String
Urk! What Show dictionary should Hugs use when
Simon Peyton-Jones [EMAIL PROTECTED] tries his hand at
inventing free theorems for qualified types, then concludes:
In which case we could report ambiguity a bit less often. How
useful this would be I don't know.
A lot. Any time one is testing the empty case of a bulk type. If
you're coding
Hi all,
I though you might apreciate this:
I've been reading the BOFH (Bastard Operator From Hell) serialisation
in The Register (www.theregister.co.uk) far to much recently.
He (the bastard) often uses his excuse board to confuse his helpless
users.
http://bofh.ntk.net/ExcuseBoard.html
I
Simon Peyton-Jones wrote:
...
msg :: forall a. Show a = String
Urk! What Show dictionary should Hugs use when evaluating msg?
You may say it doesn't matter, but in general that's not the case.
In the case of class Num, for example, we might have
expr = 3+4
msg =
Bjorn Lisper [EMAIL PROTECTED] writes:
data LispList t = Atom t | LispList [LispList t] | Str [Char]
instance Show t = Show (LispList t) where
show (Atom t) = show t
show (LispList t) = show t
show (Str t) = show t
hugsprompt (LispList [Atom 1, Str HEJ]) == [1,HEJ]
MK 02 Oct 2001 15:16:27 +0300, Dmitry Astapov [EMAIL PROTECTED] pisze:
I need to define SetsAsLists as an instance of Set by supplying
definitions for all Set methods, but definitions I wrote led me to
adding additional constraints on union and memeber methods.
MK What constraints? The
13 matches
Mail list logo