But what type does the selector 'item' have? Phil, Mark and Jeff think:
item :: Ord a = Tree a - a
This looks correct to me, too.
If an order is needed to construct a tree, say a search tree, the very same
order is (or may be) needed to select an item, e.g. by
What does nub stand for? (This is the first I've heard of it.)
Hmm, maybe that's not such a great explanation. I wonder who can come up
with the best acronym? My contribution is
Note Unique Bits
no duplicates (or no doubles) although that's no acronym
Christian
Hi,
when installing ghc and hugs under SuSE linux 8.1 I got
configure: error: can not guess host type; you must specify one
It worked after I added --host=i386-linux
Christian
___
Haskell mailing list
[EMAIL PROTECTED]
I forget whether I've aired this on the list, but I'm seriously thinking
that we should change 'forall' to 'exists' in existential data constructors
like this one. One has to explain 'forall' every time. But we'd lose a
keyword.
exists (like forall in ghc only) could be used independently in a
Hi,
whenenver I open a haskell file (*.hs) with my xemacs I get an annoying
warning in a splitted window:
(1) (error/warning) Error in `post-command-hook' (setting hook to
nil): (void-variable imenu--index-alist)
The modes (Haskell Font Ind Doc) seem to work, though.
My xemacs has [version
Sven Panne wrote:
Christian Maeder wrote:
whenenver I open a haskell file (*.hs) with my xemacs I get an annoying
warning in a splitted window:
(1) (error/warning) Error in `post-command-hook' (setting hook to
nil): (void-variable imenu--index-alist) [...]
Try adding
(require
There isn't a standard mechanism for binary I/O.
NHC98 contains the York Binary library. Can someone tell me if this is
available for other Haskell systems? And didn't GHC also provide binary I/O?
How does the GHC itself read/write binary data, since the interface
files (*.hi) produced by GHC
Johannes Waldmann wrote:
I do think that self-defined operators make a programm less readable.
I quite like most combinators from the pretty-printer or parsing libraries!
And what's absolutely horrible (IMHO) is to allow the user
to declare arbitrary precedence and associativity for his
Andrew J Bromage wrote:
Of course you could always allow overloading _without_ requiring
module qualification (unless the overloading can't be resolved
using type information). It'd make type checking NP-hard, but I
seem to recall that it's already more complex than that.
Mere overload resolution
Hal Daume wrote:
Suppose I have:
module M1 where
import M2
foo = 'a'
and
module M2 where
import M3
and
module M3 where
foo = True
Now, inside M1, I want to write something like:
bar = if M2.foo then M1.foo else 'b'
M2 must reexport foo:
module M2 (foo) where
import M3
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
Andrew J Bromage wrote:
As a matter of interest, is there a known worst-case complexity for
the precomputation required by Earley's algorithm to handle arbitrary
CFGs?
Earley's algorithm handles exactly arbitrary (in particular ambiguous)
CFGs without precomputation.
see i.e. Aho,Ullman, The
Brett G. Giles wrote:
Naturally, there are many great resources for this at www.haskell.org
Ensure you check out both Alex and Happy for the parsing and sourcing.
(note that Alex is currently being re-written, I'm not sure if the latest
public version has the new format/syntax)
I think, parsing
Hi,
I wonder why Haskell only allows the unary minus on the left side of an
expression (lexp in the grammar).
There should be no problem to uniquely recognize an unary minus right
beside an operation symbol (qop). Does the grammar allow two
consecutive qops in other cases?
This would allow 1
I wrote:
I wonder why Haskell only allows the unary minus on the left side of
an expression (lexp in the grammar).
The unary minus may also occur on the right hand side (rule: exp - lexp).
So -1 == -1 is correct, because == has lower precedence than -.
Also -1*2 is correct although it is
Hi,
For GHC (6.0.1)
main=interact id basically echoes every line of my input, whereas
main=interact show correctly waits for EOF before outputting something.
Furthermore the buffering mode must be LineBuffering.
If I explicitely set the buffering to NoBuffering I'm not able to
enter EOF by
main=interact id basically echoes every line of my input, whereas
main=interact show correctly waits for EOF before
outputting something.
Which of these are you claiming is wrong?
I guess interact does what it should, but I think it should be changed
to avoid interleaved in- and output.
lose
I wrote:
main=interact id basically echoes every line of my input, whereas
main=interact show correctly waits for EOF before
outputting something.
The unix cat and sort behave in a similar way (sort obviuously has
to wait for the last line.)
Still I would regard it to be more pure (or abstract)
Malcolm Wallace wrote:
[...]
Surely the name suggests that interactive behaviour is required, i.e.
exactly some interleaving of input and output. The chunk-size of the
interleaving should depend only on the strictness of the argument to
interact.
I'm not happy that interleaving depends on the
I wrote:
But looking at the two actions of interact:
interact f = do
s - getContents
putStr (f s)
I would expect the first action to be finished before the second
Keith Wansbrough wrote:
Why?
Because the actions are written down in that order? Why not? Why should
I expect pipelining?
Can actually someone supply an implementation of something like interact
that does no pipelining for the argument id? Simply doing putStr !$ f
!$ s was not enough!
Yes, of course.
Your code above only forces the evaluation of the first cons-cell of
the list, which is not enough. You want to
Hi,
on:
http://www.haskell.org/bookshelf/
the link for: Online Haskell Course by Ralf Hinze (in German).
should be changed from:
http://www.informatik.uni-bonn.de/~ralf/teaching/HsKurs_toc.html
to:
http://www.informatik.uni-bonn.de/~ralf/teaching/Hskurs_toc.html
At least my browser seems to be
rui yang wrote:
I want to print a function which itself have some functions as it's parameters
and will return some functions as the results, and I want to print out the
result, does anyone knows how to define the instance declaration of show class
to this function type?
I don't know if it
Hi,
if I try to supply a signatur for the local function showsl below,
then ghc rejects a constraint (Show a) whereas hugs (and nhc98) needs
this constraint.
What should be the correct notation? (apart from omitting any signature)
Cheers Christian
(BTW, I would appreciate if the
I've just noticed that I used ghc with -fglasgow-exts.
Without extensions hugs, ghc und nhc98 consistently need the constraint
in the type signature (below)
showsl :: Show a = List a - ShowS
Switching the extensions on, breaks this code, however (ghc only).
Christian
I wrote:
Hi,
if I try
Tomasz Zielonka wrote:
On Tue, Jan 13, 2004 at 12:44:10PM +0100, Stefan Holdermans wrote:
abstract and I cannot extract the line and column numbers from a SourcePos
value. What are my options?
What about these?
sourceColumn :: SourcePos - Column
sourceLine :: SourcePos - Line
These
Hi,
In a local copy of Parsec.Prim I've added a primitive, that may be of
help for your problem as well.
consumeNothing :: GenParser tok st ()
consumeNothing = Parser (\state - Consumed (Ok () state (unknownError
state)))
With this I've implemented:
checkWith :: (Show a) = GenParser tok st a
Koen Claessen wrote:
And instead of:
mapSet, emptySet, ...
We have:
Set.map, Set.empty, ...
This is how Chris does it in Edison.
and Daan Leijen in DData: http://www.cs.uu.nl/~daan/ddata.html
Christian
(Well, Set.map is actually missing there)
Hi,
after checking out fptools from cvs. The simple sequence
$ autoreconf
$ ./configure
$ make
failed in the directory hood, because the target boot is unknown there.
Could/Should this be fixed?
I know how to use mk/build.mk and the ProjectsToBuild variable. I don't
need hood, but make still
Simon Marlow wrote:
If you don't want to build hood, then remove it from the tree. Did you
perhaps check out *everything*? The right way is to check out fpconfig
Ah, that was my error. I checked out everything by cvs co fptools
instead of only doing cvs co fpconfig. (When I read fpconfig, I
Stefan Monnier wrote:
I have recently taken over maintainership of Haskell-mode, and after making
a bunch of changes, I figured it would be a good idea to make a new release.
You can find this new release at:
http://www-perso.iro.umontreal.ca/~monnier/elisp/
Thank you!
This release has
Luo Shuli wrote:
Dear Haskellers,
I am a beginer of the haskell language and study it from Yet Another
Haskell Tutarial of Hal Daume III.
Example from the tutarial:
Prelude map Char.toUpper Hello World
This works only with ghci
I try it on Hugs for windows32, compile error:
Wolfgang Jeltsch wrote:
can anybody tell me what the German translation of the word kind as used in
type theory and especially in Haskell is?
Even Peter Thiemann in Grundlagen der funktionalen Programmierung
(1994) did not translate Kind, although he used geschönfinkelt for
curry (honoring
mt wrote:
hi,
i'd like to know how to write simply a line-based interactive program, that
is
one with which you have a 'talk'.
I would start with:
main =
do putStrLn Please enter text (or press return to exit):
s - getLine
if s /= then do
putStrLn s
Bulat Ziganshin wrote:
Hello Colin,
Thursday, July 07, 2005, 4:33:39 PM, you wrote:
type FilterProgram = [Line] - [Line]
CR interact :: (String - String) - IO ()
and there is lines and unlines functions to do just what yopu need
example: main = interact
Colin Runciman wrote:
output are less than a line! However, there is no need to build
line-buffering into the system, because it is easily defined in Haskell:
buffer xs = foldl const xs xs
I don't find it this easy nor a good programming practise.
My interaction depends on the (subtle
Frederik Eaton wrote:
main = do
let a = (map (\x-
x+1) --*
[0..9]) --*
print a
seeing this, I wonder if do-statements (and qualifiers in list
comprehensions) could be easily extended by an alternative for simple
declarations (without mutual recursion and type
Hi,
maybe try using fullRender with defaults (mode=PageMode, lineLength=100,
ribbonsPerLine=1.5) and a instantiated to IO() so that TextDetails
can be appended to a file (handle).
HTH Christian
Johannes Waldmann wrote:
Dear all,
I am writing a long string (several MByte) to a file,
with
Hi,
I've just noticed that haddock-0.7 creates Data-Map.html instead of
Data.Map.html files (and links to these files)!
I've actually proposed this change, but it does not fit to the currently
released haddock documentation of the libraries. (Our web server used to
reject the file Data.Map.html,
Georg Martius wrote:
Anyway since there was no response to S. Alexander Jacobson post [1], I
decided to write these instances at least for GHC in the style of the other
instances in GHC.Read.
Who feels responsible for including something into Data.Set and Data.Map
(recently I've proposed a
Christian Maeder wrote:
Simon, clicking on any module does not work, currently
Not Found
The requested URL
/ghc/docs/latest/html/libraries/base/Control.Arrow.html was not found on
this server.
Apache/2.0.46 (Red Hat) Server at www.haskell.org Port 80
Sorry, it works now after I cleared my
Aaron Denney wrote:
I hit Submit response and view previous responses and it says
Unspecified action and a Try again... hyperlink.
I have the same problem even with our own cgi-program based on WASH and
ghc-6.4.1
Cheers Christian
___
Haskell
Tomasz Zielonka wrote:
Does it happen when you modify the cgi-program in the middle of a
session? This is the biggest problem with WASH - to be able to rebuild
the state from session log it needs the program structure to be
constant. I work around it by copying the current cgi-program at the
Hunter Kelly wrote:
How can I get at the underlying value? Can I only access it from
within a do construct?
Yes, I'm afraid so
Is there anyway to get at this function to return just True or False?
No, (unless you use something unsafe that I would not recommend)
Or has using something
Bruno Oliveira wrote:
Can somebody point me out the exact CVS location of the State Monad
implementation
that ships with GHC? I am a bit lost in the CVS directory structure ...
fptools/libraries/mtl/Control/Monad/State.hs
Christian
___
Haskell
Duncan Coutts wrote:
What's the semantics of insert? Does it replace an element, or does it
shirt all the elements after it one step?
It shifts all the elements after it one step. So that's why all the
finite map types are no help.
import Data.Map as Map
seqInsert i v = Map.insert i v
.
Christian Maeder wrote:
seqInsert i v = Map.insert i v
. Map.mapKeysMonotonic (\ j - if j i then j else j + 1)
Sorry, only O(n) and not O(log n). The same would apply to delete.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org
Ben Rudiak-Gould wrote:
I just realized that the class Ord should have an additional method:
class Eq a = Ord a where
compares :: a - a - Ordering - Ordering
compares x y d = case compare x y of { EQ - d ; o - o }
...
How about:
instance (Ord a, Ord b, Ord c, Ord d) = Ord
Ross Paterson wrote:
We are pleased to announce a new major release of Hugs,
How do I use the preprocessor option -F of hugs?
Without this option hugs correctly reports: unexpected symbol #
But adding -Fcpphs results in Unable to load Prelude
Christian
[EMAIL
Ross Paterson wrote:
On Tue, May 16, 2006 at 11:18:16AM +0200, Christian Maeder wrote:
How do I use the preprocessor option -F of hugs?
The problem is that cpphs (like other C preprocessors) puts #line
directives in its output, and they're not Haskell. But you can
tell it not to with hugs
Either convert your file to utf-8 encoding or read
http://www.haskell.org/ghc/docs/6.6/html/users_guide/release-6-6.html
GHC now treats source files as UTF-8 (ASCII is a strict subset of UTF-8,
so ASCII source files will continue to work as before). However, invalid
UTF-8 sequences are ignored
Iavor Diatchki wrote:
Hi,
Lately I have been using pattern guards more than usual and I find
that occasionally I need to nest them (i.e., I have alternatives with
a common prefix). This seems to happen when I need to do some
preliminary checking, followed by some decision making. Here is an
Hackage:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/multiset-0.1
Haddock: http://twan.home.fmf.nl/multiset/doc/
Darcs: http://twan.home.fmf.nl/repos/multiset/
Seeing all these nice little packages (i.e. also bimap), is there a cute
way to get a binary distribution - similar
Dear Haskell friends,
I like to announce a Haskell style scanner at
http://hackage.haskell.org/package/scan
documented under http://projects.haskell.org/style-scanner/
It's best used in conjunction with hlint
http://community.haskell.org/~ndm/hlint/
and gives many suggestions regarding the
I think, I've addressed the points made by Henning and Sebastian.
(Don't forget to cabal update.)
Cheers Christian
Dear Haskell friends,
I like to announce a Haskell style scanner at
http://hackage.haskell.org/package/scan
documented under http://projects.haskell.org/style-scanner/
Ivan Lazar Miljenovic schrieb:
We considered giving it a new name (fgl', etc.) but figured that in the
long term this wouldn't be advantagous. We feel that the situation is
analogous to QuickCheck: when the new version came out most people kept
using the old one until slowly the momentum
Ivan Lazar Miljenovic schrieb:
[...]
we don't need to repeat a parsec-2 vs parsec-3 discussion.
There are obviously different opinions that cannot be easily changed.
Well, I've created a custom instance:
http://trac.informatik.uni-bremen.de:8080/hets/browser/trunk/Common/Lib/Graph.hs
and our
Ivan Lazar Miljenovic schrieb:
Although parsec-3 can be used as an replacement for parsec-2 it would
have been better, they had different names (as argued elsewhere for the
haskell platform).
I'm sorry, I don't recall this discussion: care to summarise?
Dear Haskell friends,
I like to announce a new version of the style scanner for Haskell source
files at
http://hackage.haskell.org/package/scan
documented under http://projects.haskell.org/style-scanner/
cabal update
cabal install scan
A short description is also here:
Hi,
in our (latest) installation (ghc-5.02.3 on solaris) the module Pretty
(from the package text) did not export Style-related functions due to an
(old/wrong) interface file ../imports/text/Pretty.hi (with size 10909).
When translating Pretty.lhs ourselves it seems to work correctly (and
the
The following error message just contains a typo before existential
context.
Cheers Christian
Compiling Syntax ( Syntax.hs, ./Syntax.o )
Syntax.hs:56:
Could not deduce (Institution id1 basic_spec1 local_env1,
Institution id basic_spec local_env)
on http://haskell.org/ghc/docs/latest/set/book-hslibs.html
The requested URL /ghc/docs/latest/set/book-hslibs.html was not found on
this server.
___
Glasgow-haskell-bugs mailing list
[EMAIL PROTECTED]
Hi,
ghci seems to use a lot of cpu-time without doing something at the
prompt.
Furthermore ghc -O2 ... still creates binaries that yield a Bus
Error with gcc-3.1.
Can't that be fixed?
Cheers, Christian
___
Glasgow-haskell-bugs mailing list
[EMAIL
On http://www.haskell.org/ghc/
the link to the Users' Guide is missing.
Cheers Christian
GHC Features
This is a summary of GHC's main features. They are all described in more
detail in the Users' Guide.
The requested URL
/ghc/docs/latest/html/users_guide/book-users-guide.html was not found
How is it possible that an unused import warning is not always emitted?
Below I get a warning when I recompile everything, but no warning when I
only recompile the Main module (that contains the unused import). In
fact Main.hi changes.
Cheers Christian
Compiling GUI.ConvertDevToAbstractGraph
Despite some changes in various parts of the cvs tree, the bug is still
reproducable:
do the following (on a linux machine with a bash):
export
CVSROOT=:pserver:[EMAIL PROTECTED]:/repository
cvs checkout uni
cvs checkout HetCATS
cd uni
./configure
make boot
make all
cd ../HetCATS
make
make
This happens when partially recompiling with -O (I thing I've send a
similar bug-report that was kept in the moderator's queue because it was
to slightly too large - over 40K )
Christian
Thomas Hallgren wrote:
Hi,
I managed to distill my program into to the following small example that
still
Simon Peyton-Jones wrote:
Should be fixed now -- can you try with the HEAD?
yes, it work now! Thanks
Christian
| ghc-6.4.20050220: panic! (the `impossible' happened, GHC version
| 6.4.20050220):
| eval_data2tag
| GHCziPrim.dataToTagzh{(w) v 95f}
| @ (Bug.S{tc r14v}
Hi,
I also have (a rather large) program (not included) that segfaults when
compiled with profiling. I use the ghc-6.4 linux binary distribution
from the web.
It is not even necessary to call the program with +RTS -p -RTS. There is
no problem with ghc-6.2.2, except that the old version uses its
Axel Simon wrote:
gcc -O -Wall -I../../../ghc/includes -I../../../ghc/rts
-I/core/include-c env.c -o env.p_o
cc1: /core/include: Not a directory
My gcc does not complain about that missing directory. I was able to
create a working installation under solaris with:
./configure
Axel Simon wrote:
Warning: retaining unknown function `getgrnam_r' in output from C compiler
I haven't overridden anything in build.mk, so I assume SplitObjs=YES.
When would I observe these warnings?
the first time when the inplace compiler translates System/Posix/Resour
ce.hs
I just see
If that's any confort? I get a similar error (with ghc-5.04.2 and the
ghc-6.4.1.20050517 sources)
Cheers Christian
stage1/nativeGen/AsmCodeGen.o(.text+0xc2b6): In function `smsr_ret':
: undefined reference to `GHCziPrim_zdwZ2H_entry'
stage1/nativeGen/AsmCodeGen.o(.text+0x8472): In function
Axel Simon wrote:
I'm using gcc 2.95.4, maybe that's the oddity. ld is
GNU ld version 2.12.90.0.1 20020307 Debian/GNU Linux
I have:
gcc (GCC) 3.3.4 (pre 3.3.5 20040809)
GNU ld version 2.15.91.0.2 20040727 (SuSE Linux)
and my config.log and gmake.log files can be found at:
this bug is fixed in ghc-6.4.1 (see my attached profile)
Christian
Daniel Fischer wrote:
Hello,
I have encountered some strange behaviour with David Tweeds LaTeX-preprocessor
(slightly modified code attached).
When I compile it for profiling (-prof -auto-all) and run it on a .tex-file
Mirko Rahn wrote:
I've found a way to speed up your code for ghc-6.4.1.
Replace the where with a case in PCP.Suc.suc_rules (see below)
Okay, thanks, that works fine.
Yes, It's even quite fast without optimization (I did not check with
ghc-6.4, though)
(Maybe that is a good idea in
Hi Baltasar,
maybe it's GHC's inliner. See
http://www.haskell.org/ghc/docs/latest/html/users_guide/bugs.html#bugs-ghc
and the russel example is similar enough to yours. (I have not
checked, though.)
I apologize, again, for the wrong spelling, It must be Russell with
two l!
Cheers
Chris Kuklewicz wrote:
Greg Buchholz wrote:
True. But there are some tests like fasta that appear to have a
laziness induced space leak that presumably could be fixed.
http://shootout.alioth.debian.org/benchmark.php?test=fastalang=all
Already the following bit exhibits unexpected
Tomasz Zielonka wrote:
On Tue, Dec 27, 2005 at 08:12:20PM +0100, Christian Maeder wrote:
Already the following bit exhibits unexpected memory consumption:
main = mapM_ print $ take (n * 5) $ drop (n * 3) [1..]
n = 10
I think it's the (succ (succ (succ ...))) thunk. When you change
Simon Peyton-Jones wrote:
Just to let you know, I can reproduce this problem nicely (thank you for
setting up the repro case). It turns out to be caused by the
simplifier's inlining policy which goes if not exponential then
something very like it. It's made dramatically worse by the fact that
139828 2006-01-26 19:58 HasCASL/PrintLe.o
Christian Maeder wrote:
P.S. I've changed infixl to infixr
infixr 6
infixr 6 +
infixr 5 $$, $+$
Not much difference in code size but a bit faster compared to the
numbers I've posted before:
http://hackage.haskell.org/trac/ghc/ticket/490
Linking ...
real
-rwxr-xr-x 1 maeder wimi 6213885 2006-01-26 20:11 a.out
-rw-r--r-- 1 maeder wimi 1762784 2006-01-26 20:09 HasCASL/PrintLe.o
Christian Maeder wrote:
Sorry, I forgot to save my changes. The numbers are much better with
infixr:
Linking ...
real5m30.666s
user4m56.950s
sys 0m9.262s
[EMAIL
The attached 4 files compile with ghc-6.4.1 and fail with
ghc-6.5.20060201 (see below).
Also, if I delete the Int and Integer instances in
Common/ATerm/Conversion.hs the error remains the same for ghc-6.5
whereas ghc-6.4.1 correctly complains about
No instance for (ShATermConvertible Int)
Christopher Brown wrote:
Christian,
Did you try the switch -fallow-overlapping-instances when compiling?
Yes, but it doesn't seem to make much difference.
Maybe a couple of more library files have not been translated with the
above flag.
Simon Marlow wrote:
The best way to proceed would be to run the testsuite with the stage 1
compiler. Grab the test suite from here:
http://www.haskell.org/ghc/dist/6.4.2/ghc-testsuite-6.4.2.tar.gz
unpack it into your 6.4.2 build tree, cd testsuite, make boot, cd
tests/ghc-regress, make 21 |
Simon Marlow wrote:
In GHC 6.4.2, the stage 2 compiler is built with -threaded, this is a
change from previous versions. If -threaded isn't working properly,
then the stage 2 compiler will be affected - that seems to be the case
on Solaris.
To get going, you could just disable -threaded in
Simon Marlow wrote:
I've fixed the cause of the hangs on Solaris, I believe. Also, the
ctime_r() and -lrt problems are both fixed. If you grab the
ghc-6-4-branch from CVS you'll get the code with these fixes.
I'd be interested to know if it works for you, and if you could do a
testsuite
Simon Marlow wrote:
I've fixed the cause of the hangs on Solaris, I believe. Also, the
ctime_r() and -lrt problems are both fixed. If you grab the
ghc-6-4-branch from CVS you'll get the code with these fixes.
This problem still exists:
RtsUtils.c: In function 'time_str':
RtsUtils.c:197:
Simon Marlow wrote:
I've fixed the cause of the hangs on Solaris, I believe.
Yes, hanging is gone, but the binary segfaults now immediately (with
hello.hs)
Also, the
ctime_r() and -lrt problems are both fixed.
Only the -lrt problem is fixed.
I'd be interested to know if it works for
Hi Florian,
it seems, that you fall over the same problems I had under solaris.
GHC-6.4.2 does not work under solaris, currently.
I've build a binary distribution (without -threaded) that seems to work
at least as good as the ghc-6.4.1 version did.
You may try out:
Christian Maeder wrote:
I'm currently running the ghc-regression test (with stage1/ghc-inplace),
but that does not look good (although it does not hang)
here is the frustrating summary:
OVERALL SUMMARY for test run started at Mon May 22 18:30:30 CEST 2006
1365 total tests, which gave rise
Simon Marlow wrote:
It looks like every GHCi test failed (the TH tests use GHCi internally,
so they failed too).
Does GHCi fail? If so, in what way?
simply doing gmake in tests/ghc-regress is no good idea, because the
stage1 compiler is used.
the stage2 compiler is unusable:
Cheers
Duncan Coutts wrote:
file /usr/lib/ghc-6.4.2/HSbase.o
/usr/lib/ghc-6.4.2/HSbase.o: ELF 32-bit MSB relocatable, SPARC32PLUS, V8
+ Required, version 1 (SYSV), not stripped
I don't think that is my problem. Possibly my stage1 compiler isn't that
bad (as it only lacked ghci support), whereas my
Hi Simon,
I've recompiled ghc-6.4.2 from cvs again without -threaded. The
regression test looks much better now (below). The conc-cases go through
now, but the following problems do still exist:
cc04 (and ffi012) reported: 'calling convention not supported on this
architecture: stdcall'
Simon Marlow wrote:
Do you know if the stage2 compiler works with -threaded? Or does it
still crash?
The stage2 compiler created with -threaded seg-faulted even for a simple
hello.hs. That's the reason I've switched off -threaded.
That needs to be investigated.
I've no clue how to go
Christian Maeder wrote:
Well. at least Florenz reported independently the same ctime_r problem
under Solaris 10 in http://hackage.haskell.org/trac/ghc/ticket/775
Ok, he used the original 6.4.2 sources that did not have your fix. What
file was supposed to fix the problem?
C
Simon Marlow wrote:
Ach, my fault. Somehow I forgot to merge that fix into the 6.4 branch.
Sorry :-( It should be there now. The file RtsUtils.c has changed.
Ok, I'm recompiling and RtsUtils.c has been compiled by ghc-inplace now
(so your fix works)
C.
Simon Marlow wrote:
Looks like the file OSMem.o is missing from your RTS build somehow. It
should be in ghc/rts/posix.
Ah, posix is a new directory that I did not check out.
C.
___
Glasgow-haskell-bugs mailing list
Glasgow-haskell-bugs@haskell.org
The stage2 compiler non-deterministically crashes with segmentation
fault (and even works some times)
C.
-bash-3.00$ ghc/compiler/stage2/ghc-inplace --interactive
___ ___ _
/ _ \ /\ /\/ __(_)
/ /_\// /_/ / / | | GHC Interactive, version 6.4.2, for Haskell 98.
/ /_\\/ __ /
Duncan Coutts schrieb:
Try SRC_HC_OPTS = -optc-mcpu=ultrasparc -opta-mcpu=ultrasparc
With this I've produced a binary saying:
-bash-3.00$ ghc --version
ghc-6.6: schedule: re-entered unsafely.
Perhaps a 'foreign import unsafe' should be 'safe'?
Yes! I get exactly the same under sparc
1. The VERSION = 5.2 in libraries/fgl/Makefile
does not correspond to libraries/fgl/fgl.cabal
version:5.3
Probably VERSION should always be extracted from the .cabal file.
2. When installing libraries/network via cabal (under solaris) the
'extraLibraries = [nsl,socket]' have not been
1 - 100 of 926 matches
Mail list logo
