Feature Requests item #1153029, was opened at 2005-02-27 12:24
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=358032aid=1153029group_id=8032
Category: None
Group: None
Status: Open
On 28 February 2005 05:38, Kip Macy wrote:
In a clean tree I configured:
./configure --prefix=/u/kmacy/usr/x86_64
--with-ghc=/u/kmacy/src/ghc/src/ghc-6.2.2-x86_64-x86_64/ghc/compiler/ghc
-inplace
where the ghc-inplace is unregisterised, points to stage1, and is
known to compile Hello World
Feature Requests item #1153029, was opened at 2005-02-27 20:24
Message generated for change (Comment added) made by simonmar
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=358032aid=1153029group_id=8032
Category: None
Group: None
Status: Closed
Priority: 5
On 25 February 2005 15:48, Christian Maeder wrote:
we used redirect output of ghc via tee (within a Makefile). With the
new ghc this randomly fails now. Does anyone have an explanation for
this?
ghc omitted args 21 | tee log
yields:
Skipping Main ( hets.hs, hets.o )
Simon Peyton-Jones [EMAIL PROTECTED] writes:
I think I've fixed this (on the head anyway; simon will merge to branch
shortly). Care to try again?
Yup, the toplevel rigid type-variable problem seems to have been fixed,
thanks. nhc98 now builds as expected with ghc-6.4.
BTW, there seems to be
Hi,
The following either eats memory until killed or segfaults (I can't pin
down a reason for the difference). Tested with GHC 6.2.2 and 6.4.20050212,
with various different libgmp3s under various Redhat and Debian platforms,
and WinXP.
Prelude :m +Data.Bits
Prelude Data.Bits
On Mon, Feb 28, 2005 at 02:55:56PM +, Ganesh Sittampalam wrote:
Hi,
The following either eats memory until killed or segfaults (I can't pin
down a reason for the difference). Tested with GHC 6.2.2 and 6.4.20050212,
with various different libgmp3s under various Redhat and Debian
On Mon, 28 Feb 2005, Remi Turk wrote:
On Mon, Feb 28, 2005 at 02:55:56PM +, Ganesh Sittampalam wrote:
Prelude :m +Data.Bits
Prelude Data.Bits 18446658724119492593 `shiftL` (-3586885994363551744) ::
Integer
and calculating, in your case, 2^3586885994363551744 is not
something your
On Mon, Feb 28, 2005 at 10:59:32PM +, Ganesh Sittampalam wrote:
On Mon, 28 Feb 2005, Remi Turk wrote:
On Mon, Feb 28, 2005 at 02:55:56PM +, Ganesh Sittampalam wrote:
Prelude :m +Data.Bits
Prelude Data.Bits 18446658724119492593 `shiftL` (-3586885994363551744) ::
Integer
Hi,
I have been racking my brain over the infamous 'gfoldl' and 'gunfold'
combinators. (Yes, I have read the papers). What finally made me understand
how they worked was reading the code: first the implementation of the gmap
functions (Data/Generics/Basics.hs), then the long and detailed
That's a very good point.
Me too, I would often wish to see some principled
code details when entering documentation. For instance
what is the point of _explaining_ that inc aliases
add 1, why not just show that equation! I agree that
gmap?? are a bit of this kind. It is so much easier to
explain
On Mon, Feb 28, 2005 at 05:20:18PM -0800, Ralf Lammel wrote:
That's a very good point.
Me too, I would often wish to see some principled
code details when entering documentation. For instance
what is the point of _explaining_ that inc aliases
add 1, why not just show that equation! I agree
12 matches
Mail list logo
