Floralplanet.com
http://www.floralplanet.com
Visit Earth's Largest Garden and see
the Internets
most spectacular one-stop super store for fresh flowers,
silks, gift baskets, batiks, art, and other exciting gifts
!!Visit
Planet Bouquets !Now at a Galaxy ne
[ Please Distribute -- Apologies for Receiving Multiple Copies ]
[ CALL FOR PARTICIPATION: Early Registration Extended: * September 3 * ]
[ EU funded student grants available ]
--
CALL FOR PARTICIP
On Wed, Aug 28, 2002 at 10:46:34AM +0100, Phil Trinder wrote:
> Paul,
>
> The GdH implementation is currently used here, and is basically in
> beta-release form. If you would use it we could wrap up a and
> X86/Linux version for you.
That will be very sweet! I'd love to play with this thing ;-)
There are two things going on.
1. Hugs deals with mutual recursion in a more sophisticated
way than GHC. Mark T is absolutely right, and the THIH paper explains.
2. Furthermore,GHC implements the H98 requirement that the context of
all functions in a mutually recursive groups must be the same
They aren't identical.
runST guarantees to run a complete state thread that can't interact
with any other. stToIO runs some imperative actions that might
interact with other stToIO calls.
You might find it helpful to read 'State in Haskell' if you havn't
already done so.
Simon
| -Origi
I don't know what you are trying to do, but I do know why your program
is rejected.
The *whole point* of a value of type (STArray s Int Int) is that it can
only
be read by a state thread with the same type parameter 's' as the array.
Given your decls
> class Foo a where
> foo :: a -> IO Int
Hal
I don't quite understand the intuitions behind your program, but the
bug is easy enough:
| instance (Eq e, Foo p) => Foo (Wrap p) where
| foo (Bar p) e q = foo p e q
This instance declaration is guaranteed to give problems if it is
ever used, and GHC should probably bleat about it. Suppo
Dear All,
Hal's comments on the use of Evaluation Strategies for controlling
strictness are substantially right, and they are used this way in Eden, a
parallel Haskell. In Glasgow parallel Haskell(GpH) we use them to control
parallel evaluation as well. The key reference is
Algorithm + Stra
Paul,
The GdH implementation is currently used here, and is basically in beta-release
form. If you would use it we could wrap up a and X86/Linux version for you.
The GUM implementation of GpH and GdH uses very simple communication (mainly
point to point, with a single barrier synchronisation,