Running the programs compiled with ghc-4 (several examples), i have
noticed that it pretends to spend thousands of space less than
ghc-3.02. Typically,
ghc-3.02 with +RTS -H100k -K9k runs as fast as
ghc-4with +RTS-K4
According to 4-00-notes.vsgml, the latter -K4 means
There was a `panic' report from me on ghc-4 on October 20.
Here is some additional observation.
'Panic' mentions specially cPMul in the end.
The latter is an operation from the constructor class
class Dom p = PolLike p
where
pIsZero :: p a - Bool
pIsConst :: p a - Bool
...
[EMAIL PROTECTED] writes:
Hi
I'm new to Haskell and GHC, but have had experience with
Miranda. As part of my final year Software Engineering
project at Imperial College, I am hoping to investigate
possible concurrent garbage collection schemes for GHC.
Good stuff - let us (i.e.
Sergey
This goes back to the discussion about how to get both the expressiveness
you want and decideable type inference. The rule about not having all
type variables in instance decls is to ensure that context reduction
terminates. The undecideable-instances flag lets you switch off this
This feature is great, especially for programs which don't have flat
heap usage needs. Finding a good default sizing policy, and a simple
set of controlling options, may be a little tricky.
The following datatype declaration would, if possible,
actually be very useful for an application I have in mind:
module Test(V(..)) where
import ST
data V s = forall a . MkV (STRef s a) deriving Eq
Weird! You could never use the reference for anything, because
its type is
The correct behaviour would be to let the above pattern match fail
in the case of different types at r1 and r2,
because the left-hand side has to have a typing
with equal types for r1 and r2
induced by the right-hand side ``r1 == r2''.
But now you are assuming that there is an intentional
Let me get this straight: you want to replace "import qualified"
with "with", "import" with "use", and "=" with "rename"? That
sounds like it's 180 degrees away from what I propose. My intention
was to eliminate the need for either new keywords or special
syntactic categories for
On 20-Oct-1998, David Barton [EMAIL PROTECTED] wrote:
I really do think that one additional level (from the module name
pair to a library module name triple) and mapping between
libraries and directories via user variables is all we need.
I don't think three levels is really satisfactory.
I am wondering if it would be feasible to declare laws that are guaranteed
to hold for some objects in a Haskell-like functional language.
It's feasible. But you need a richer language than Haskell.
A language with dependent types would work. Take a look at Cayenne.
It can express these kind
Christoph Herrmann wrote:
"Gabor" == Gabor Greif [EMAIL PROTECTED] writes:
Gabor I am wondering if it would be feasible to declare laws that
Gabor are guaranteed to hold for some objects in a Haskell-like
Gabor functional language.
I think that's such an important point that
On Wed, Oct 21, 1998 10:10 Uhr, Johannes Waldmann
mailto:[EMAIL PROTECTED] wrote:
i'd like to see answers to Gabor's first example (commutativity).
on a general note, this leads to term rewriting
modulo some equivalence relation (comm. and assoc. seem most common),
which gets pretty tough (all
On Wed, Oct 21, 1998 11:30 Uhr, Ch. A. Herrmann
mailto:[EMAIL PROTECTED] wrote:
At the moment, I'm using special comments [Int,{-! 5 !-}], e.g.,
to tell a preprocessor that a list always has length 5 but I don't
like to use such methods for the far future.
Let's play with this one:
property
At 16:41 +0200 98/10/19, Gabor Greif wrote:
I am wondering if it would be feasible to declare laws that are guaranteed
to hold for some objects in a Haskell-like functional language.
For example I would like to declare that (+) is commutative.
I think such things might be implemented via
That being said, if Haskell simply added support for hierarchical
namespace and a standard path convention for finding
libraries and source,
I would be ecstatic. Better scoping, nicer import operators, and more
visibility control are just bonus.
Personally I'm quite sympathetic to the
This discussion seems to be mixing a few different issues. I believe any
proposal here needs to satisfy three criteria:
1. it must allocate top level name space in a way that prevents collisions
2. it must allow an implementation to resolve names to locations efficiently
3. it must give
16 matches
Mail list logo
