#754: EVACUATED object entered
+---
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug | Status: new
Priority: normal |Milestone:
Component:
When building 6.4.2 today, make died with
../../ghc/compiler/ghc-inplace -H16m -O -Wall -fffi -Iinclude '-#include
HsALUT.h' -cpp -DCALLCONV=ccall -ignore-package ALUT -O -Rghc-timing
-fgenerics -package base -package OpenGL -package OpenAL -fgenerics
-split-objs-c Sound/ALUT/Version.hs
Hello everybody, nice to meet you all.
Last year I did work on an Haskell project during the first year of
the Google Summer of Code programme[1]. I wrote the bindings to the
Cairo Vector Graphics library and integrated them in Gtk2Hs. You can
see last year's announcement on the
On Sat, 2006-04-22 at 16:38 +0200, Paolo Martini wrote:
Let me briefly summarize how the project works; it starts with a
number of mentoring organizations that support active open source
projects. They are required to publish a list of projects for
students to apply for, and some
I am having trouble making a type system for my EDSL in Haskell. Can
someone help? A simplified description of my problem follows.
I have three classes, A, B1, and B2. I want all instances of B1 to
be instances of A. I want all instances of B2 to be instances of A.
None of the classes
On 4/22/06, Robin Bate Boerop [EMAIL PROTECTED] wrote:
I am having trouble making a type system for my EDSL in Haskell. Can
someone help? A simplified description of my problem follows.
I have three classes, A, B1, and B2. I want all instances of B1 to
be instances of A. I want all
This does not work. The compiler gives the same error with or
without -fallow-overlapping-instances.
--
Robin Bate Boerop
On 22-Apr-06, at 12:39 PM, ihope wrote:
On 4/22/06, Robin Bate Boerop [EMAIL PROTECTED] wrote:
I am having trouble making a type system for my EDSL in Haskell. Can
On 4/22/06, Robin Bate Boerop [EMAIL PROTECTED] wrote:
This does not work. The compiler gives the same error with or
without -fallow-overlapping-instances.
Just what is the error?
___
Haskell mailing list
Haskell@haskell.org
The error given by GHC (with or without the -fallow-overlapping-
instances) is
question.hs:6:0:
Duplicate instance declarations:
question.hs:6:0: instance (B1 x) = A x
question.hs:7:0: instance (B2 x) = A x
--
Robin Bate Boerop
On 22-Apr-06, at 1:01 PM, ihope wrote:
On
I have some projects I'd like help with, and I'd enjoy mentoring. Is there any match-making structure yet (even a wiki page) for Haskell mentors and mentees, e.g., listing interest areas and/or specific projects? Cheers, - Conal
On 4/22/06, Paolo Martini [EMAIL PROTECTED] wrote:
Hello everybody,
Robin,
The following does NOT work, because of a duplicate instance declaration
for A:
class A a
class B1 b1
class B2 b2
instance B1 x = A x
instance B2 x = A x -- duplicate instance, won't compile
data T = T
instance B1 T
Yes, this doesn't work and I think there is no GHC extension that
Gerrit,
Thanks for your help. Yes, your suggestion below will allow me to
give only an instance declaration for B1 (and get the A declaration
for free, if you will).
However, I meant to suggest that there were other T's which are not
instances of B1 but of B2. I will be back in the
You want all instances of B1 to be instances of A and all instances of B2 to
be instances of A.
This means:
forall a. B1 a = A a
and
forall a. B2 a = A a
I think this is not possible with type-classes and the type class extensions
in Haskell, because the compiler can't construct the
You want all instances of B1 to be instances of A and all instances of B2 to
be instances of A.
This means:
forall a. B1 a = A a
and
forall a. B2 a = A a
I think this is not possible with type-classes and the type class extensions
in Haskell, because the compiler can't construct the
I have three classes, A, B1, and B2. I want all instances of B1 to
be instances of A. I want all instances of B2 to be instances of A.
if you mean to ensure that an instance of A should be a pre-requisite
for defining instances of B1/B2, then your second approach might be
more
Greetings!
I'll try to update the Haskell community periodically on the status of
the Haskell' language standard.
As mentioned previously, we are currently focusing on two topics,
concurrency and the class system. If you feel that you have anything
important to contribute to those topics, now
Claus,
You have given a very good analysis of the situation. Thank you.
I mean to ensure that an instance of A is a necessary consequence of
having an instance for either of B1/B2, in your words. Further, in
my situation, no data type will be an instance of both B1 and B2.
So, the
Paolo,
Thanks for your work in organizing this.
Google wants an answer from me by Monday (I seem to be the point of
contact). So if you have objections, let us know!
Feel free to forward this to anyone you think would want a say in the
matter.
peace,
isaac
Paolo Martini [EMAIL PROTECTED]
Il giorno 22/apr/06, alle ore 23:50, Isaac Jones ha scritto:
Paolo,
Thanks for your work in organizing this.
Google wants an answer from me by Monday (I seem to be the point of
contact). So if you have objections, let us know!
Feel free to forward this to anyone you think would want a say
Conal Elliott ha scritto:
I have some projects I'd like help with, and I'd enjoy mentoring. Is
there any match-making structure yet (even a wiki page) for Haskell
mentors and mentees, e.g., listing interest areas and/or specific
projects? Cheers, - Conal
Hello Conal,
Thank you very
hello ; I am learning to use to HOpenGL to complete an asignement for next week and I have some trouble ; I have found a tutorial on the internet ; in that tutorial it was an example of the Rubik's Cube ; anyway ; in that example it was used a function called matrixExcursion ; and when I try to
hello again ; I am writing again to ask you if you can please show me an example of loading a bitmap on a window; I tried tu use the bitmap function from Graphics.Rendering.OpenGL.GL.Bitmap but it gives me an error ; I've called the function like this : bmp - bitmap (Size (100,100)) (Vertex2
Hello,
I do not know the answer to your question, but I can tell you that sent
the message to the wrong mailing list; this mailing list is about the next
version of Haskell. If you send your questions to Haskell-cafe (see
http://www.haskell.org/mailman/listinfo/haskell-cafe) it is more
Well, now that we've started this discussion I presume it's okay if I
ask a few things. I don't know if these are good ideas, but I thought
I'd throw them out.
Basically, I am a student and would be eligible for the SoC.
I'd like to work on something related to numerics support or
performance in
[EMAIL PROTECTED] wrote:
Robert Dockins wrote:
One additional (very unfortunate) point is that higher-order IO monad
combinators will not work on your monad, eg, the ones in
Control.Exception.
Although that is true in general, for many useful and interesting
cases (including ReaderT, the
hello; I am writing to ask you a thing ; I am writing a little game on Haskell's HOpenGL ; the game isn't much , but I want to make look a little better ; and for that I want to use bitmaps (or textures) ; I don't know very much about this subject ; I've tried to use de bitmap function from
Hi -
I have the following code:
data MState = MState -- details omitted
type MonadStateMState = MonadState MState -- necessary for Haddock
newtype ManagerM a =
ManagerM (StateT MState IO a)
deriving (Monad, MonadIO, MonadStateMState)
which means that ManagerM is
Hi -
You could try something like:
import Foreign.Ptr
import Foreign.C.String
bmp - withCAString C:\1.bmp $ bitmap (Size (100,100)) (Vertex2 0 0)
(Vertex2 0 0)
and if that doesn't work try withCString or withCWString. I'm assuming that
the Ptr a in the docs is supposed to be a pointer to a
Brian Hulley wrote:
Hi -
You could try something like:
import Foreign.Ptr
import Foreign.C.String
bmp - withCAString C:\1.bmp $ bitmap (Size (100,100)) (Vertex2 0 0)
(Vertex2 0 0)
and if that doesn't work try withCString or withCWString. I'm
assuming that the Ptr a in the docs is supposed to
29 matches
Mail list logo
