This is for your information only, I am not asking for any help. (I
compiled ghc-5.00 with the standard procedure and didn't encounter a
single caugh -- quite impressive!)
With operational and `make install'ed ghc-5.00 and ghci-5.00, I
changed the optimization flags:
Is there any prediction for when the Windows (NT) binary distribution
for GHC 5.00 will be available? I would not want to install GHC5.00 from
the source distribution in case the binary distribution is going to be
released "soon". Anyway, I would expect getting an appropriate note via
the
Yes, it'll be 'soon' (days, or a week or three, but not months)
Simon
| -Original Message-
| From: Bernd Holzmüller [mailto:[EMAIL PROTECTED]]
| Sent: 16 May 2001 08:38
| To: [EMAIL PROTECTED]
| Subject: Windows binary installation for GHC 5.00
|
|
| Is there any prediction for when
Title: Problems building GHC 5.00 on Solaris 2.5.1
I'm trying to build GHC 5.00 on Solaris 2.5.1.
I've got most of the way there. So far, I've had to:
- Hack glafp-utils/sgmlverb/Makefile because by lex doesn't support the -8 option.
- Hack mk/target.mk in several places because my ld
On Wed, 16 May 2001, Fergus Henderson wrote:
On 15-May-2001, Wojciech Moczydlowski, Jr [EMAIL PROTECTED] wrote:
On 15 May 2001, Marcin 'Qrczak' Kowalczyk wrote:
What should be improved compared to existing STUArray Int Double
and similar?
A simple standard proposal, not using ST
Due to various requests, the DEADLINE FOR SUBMISSIONS to
WFLP 2001
International Workshop on Functional and (Constraint) Logic Programming
Kiel, Germany, September 13-15, 2001
http://www.informatik.uni-kiel.de/~wflp2001
has been
At 2001-05-16 00:18, Wojciech Moczydlowski, Jr wrote:
I think multiparameter type classes or other extensions to Haskell 98 are
really needed to solve these kinds of problems in a simple and elegant way.
The right solution, IMHO, is to extend nhc and other Haskell compilers
to support
I don't like the idea of a program working which compiles only under
compilers which have certain language extensions built in.
If I understand things correctly, there is a list of language
extensions
(FFI for example), which has been accepted by all Haskell
compilers developers. If
I am looking for book reviewers for the Journal of Functional
Programming. Book reviews provide a service to the functional
programming community by critically appraising many of the key
books coming out in the field.
If you are interested in becoming a reviewer, please send me an
email with
Can someone explain the following behaviour? Or is it a bug in hugs?
X690v5 (fromIntegral(toInteger(minBound::Int))::Int)
Program error: {primIntegerToInt (-2147483648)}
(15 reductions, 70 cells)
X690v5 (fromIntegral(toInteger((minBound::Int)+1))::Int)
-2147483647
(21 reductions, 29 cells)
Hello,
Can someone explain the following behaviour? Or is it a bug in hugs?
I can not explain it. Rather strange is that even this is allowed:
(fromIntegral (toInteger (minBound::Int) + 1) -1) :: Int
yielding
-2147483648
(fromIntegral(toInteger(minBound::Int))::Int)
Program error:
On Wed, 16 May 2001, Stefan Karrmann wrote:
On Tue, May 15, 2001 at 09:14:02PM +0300, Dylan Thurston wrote:
On Tue, May 15, 2001 at 06:33:41PM +0200, Jerzy Karczmarczuk wrote:
Serge Mechveliani :
...
The matter was always in parametric domains ...
Whoever tried to program real
On 16-May-2001, Steinitz, Dominic J [EMAIL PROTECTED] wrote:
Can someone explain the following behaviour? Or is it a bug in hugs?
It looks to me very much like it is a bug in Hugs.
ghc 4.04 does not suffer from this bug.
It's easy to make mistakes like this, which can often arise from
| Despite my extremely deep respect for all people contributing
| to Haskell, despite my love for the language etc. I begin to
| suspect that it has been standardized too early, and if we
| (Sergey, other people interested in math,
| as Dylan Thurston, myself, etc., as well as people who want
| | When you say there's a good theoretical foundation (typed lambda
| | calcului) I think you are imagining that when we say
| |
| | f (x::a) = e
| |
| | we are saying There's a /\a as well as a \x::a in this definition.
|
| No, that's not what I'm thinking.
OK, let me try to give some
On Wed, 16 May 2001, Simon Marlow wrote:
Besides, MArray.lhs uses ST and ST requires not only
multiparameter type
classes, but also explicit universal quantification.
ST doesn't require multiparameter type classes (although MArray does).
You're of course right.
It also doesn't
At 04:50 PM 5/15/2001 +1200, Tom Pledger wrote:
| ---
| class (MonadPlus (p s v)) = Parser p where
| item :: p s v v
| force :: p s v a - p s v a
| first :: p s v a - p s v a
| papply :: p s v a - s - [(a,s)]
| ---
[...]
The `SuitableCollection' class is
17 matches
Mail list logo
