Yes, please do so; thank you. It's very very dodgy to do so, so even if
it's not rejected, it probably should be.
Simon
| -Original Message-
| From: Volker Stolz [mailto:[EMAIL PROTECTED]
| Sent: 10 March 2003 14:40
| To: [EMAIL PROTECTED]
| Subject: (Deriving) instances in .hi-boot not
I can't seem to connect to the cvs server:
$ cvs up
cvs [update aborted]: unrecognized auth response from glass.cse.ogi.edu: cvs: error in
loading shared libraries: libz.so.1: cannot open shared object file: No such file or
directory
--
Kirsten Chevalier * [EMAIL PROTECTED] * Often in error,
On 2003-03-10 at 20:57GMT Dominic Steinitz wrote:
Can anyone help? I downloaded the latest rpm for ghc but
got the following
errors on installation:
error: failed dependencies:
libc.so.6(GLIBC_2.3) is needed by ghc-5.04.2-1
libreadline.so.4 is needed by ghc-5.04.2-1
I
==
The (Interactive) Glasgow Haskell Compiler -- version 5.04.3
==
We are pleased to announce a new patchlevel release of the Glasgow
Haskell Compiler (GHC), version
==
The (Interactive) Glasgow Haskell Compiler -- version 5.04.3
==
We are pleased to announce a new patchlevel release of the Glasgow
Haskell Compiler (GHC),
Hi,
I'm running into a problem using server code (running on a UNIX domain
socket) that I basically snatched from Simon Marlow's web server:
++
mainLoop sock defUser getMs =
do putStrLn Accepting connections...
Actually, I find it difficult to extract the sometimes drastic
differences between releases from that document (just one example:
does this release include last week's bugfixes in the Network
module?). How do I find out about the various bugfixes between
releases, to decide whether or not to
I tried the RPM for 7.2 and it seemed to work with --force and --nodeps (it
asked for libreadline.so.4 which was already there).
Dominic Steinitz
- Original Message -
From: Simon Marlow [EMAIL PROTECTED]
To: Jon Fairbairn [EMAIL PROTECTED]; Dominic Steinitz
[EMAIL PROTECTED]
Cc: [EMAIL
Simon Peyton-Jones [EMAIL PROTECTED] wrote,
| In the current CVS GHC, undoubtedly the right thing to use is
| Foreign.mallocForeignPtr. Internally these are implemented as
| MutableByteArray#, so you get fast allocation and GC, but from the
| programmer's point of view it's a normal
| | type State = Term a = [a]
| | data M a = M (State - IO(State,a))
| |
| | GHC yields a error message Illegal polymorphic type.
| | How to resolve this?
I can tell you what it happening. If you have -fglasgow-exts on, the
type
for State is short for
type State = forall a. Term
--
We apologize if you receive multiple copies of this announcement.
--
***
==
The (Interactive) Glasgow Haskell Compiler -- version 5.04.3
==
We are pleased to announce a new patchlevel release of the Glasgow
Haskell Compiler (GHC), version
Dear all,
We are proud to announce version 1.1 of Helium. It can
be found at the Helium website:
http://www.cs.uu.nl/~afie/helium/
Version 1.1 has the following improvements:
- An installer for Windows systems for an improved out-of-
the-box experience.
- A cool Java-based graphical
Can anyone help me figure out how to load QuickCheck into GHCI?
QuickCheck is included in my Debian package, but my attempts
at loading it are bootless:
Prelude :load QuickCheck
can't find module `QuickCheck'
Prelude :load util/QuickCheck
can't find module `util/QuickCheck'
Prelude :info
syntax:
[EMAIL PROTECTED] (Norman Ramsey) writes:
Can anyone help me figure out how to load QuickCheck into GHCI?
QuickCheck is included in my Debian package, but my attempts
at loading it are bootless:
Prelude :load QuickCheck
snip
Any advice, anyone?
You need to load a source file that imports
hi,
sorry for moving this back to the haskell mailing list, but i think the
module system is part of the language and is not a library.
Simon Marlow wrote:
[ moved to [EMAIL PROTECTED] ]
why not fix the design to take this into account? one can
have two ways
to refer to modules - relative
QuickCheck is in de util package. You can load a package with the
-package flag:
$ ghci -package util
Prelude :browse QuickCheck
class Arbitrary a where {
arbitrary :: Gen a; coarbitrary :: forall b. a - Gen b - Gen b; }
arbitrary :: forall a. (Arbitrary a) = Gen a
...
Prelude:module
I'll answer my own question; I've got a much better implementation, along
with an HOpenGL-based frontend, at
http://ofb.net/~abe/hlife/hlife-0.1.tar.gz;. It uses a FiniteMap of 5x5
UArrays that are created and destroyed as needed; this gives it a good
balance of size (the grid is only bounded by
18 matches
Mail list logo