> When I run "make all" I get:
> [...]
> ghc-6.0: unknown package name: Main
I believe what is going wrong is that you have some old .hi files from
greencard 3.00 lying around. These were slightly broken in that they didn't
use the -package-name flag reliably and so ghc plugged in the default
> The link to the source on http://haskell.org/graphics/downloading.html
> should be http://haskell.org/graphics/downloads/HSHGL-3.00.tar.gz
> I guess.
Thanks!
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
2003年06月06日(金)の23時40分に Alastair Reid 曰く:
>HSHGL 3.00
> A Portable Graphics Library
Thanks for releasing this too. :-)
> The library can be downloaded from: http://www.haskell.org/graphics/.
The link to the source on http://haskell.org/graphics/down
2003年06月06日(金)の23時06分に Alastair Reid 曰く:
> HSX11 1.00
> A Haskell binding for X11
>
> In preparation for a major release of HSX11, we are making an alpha
> release for folk to play with. We welcome bug reports, comments on
> how the system is pac
[Apologies if you receive this more than once]
Call for Papers and Participation
COLOGNET Workshop on
Call for Papers
Compositional Verification of UML Models
Workshop of the UML 2003 Conference
The definition of UML has been motivated by the need for a standard
notation for modelling system architectures and behaviours at
func
This announces availability of an early phase of my Semantic Web
inferencing skeleton in Haskell (Swish), which has been posted on my web
site at:
http://www.ninebynine.org/Software/Intro.html#Swish (links)
http://www.ninebynine.org/Software/Swish-0.1.zip (software source+doc)
http://
In fact I think these Typesafe MRef's are exactly equivalent
to dynamic types. In other words, if you've got one,
you've got the other. Ralf Hinze has just shown that
if you have dynamic types you can implement Typesafe MRef.
The reverse implementation would be something like
> data Dynamic = FM
FYI, I have added a FreeBSD port some minutes ago:
http://www.freshports.org/x11-toolkits/hs-gtk2hs
Regards,
Olli
--
Oliver Braun :: [EMAIL PROTECTED]
:: Work=> [EMAIL PROTECTED]
:: FreeBSD => [EMAIL PROTECTED] -> http://people.freebsd.org/~obraun/
:: Haskell => [EMAIL PR
HSHGL 3.00
A Portable Graphics Library
In preparation for a major release of HSHGL, we are making an alpha
release for folk to play with. This release only works with X11 and
GHC (it almost certainly still runs on Hugs too but we haven't tested
recen
Am Freitag, 6. Juni 2003 16:09 schrieb Simon Peyton-Jones:
> You can't overwrite an entry with a value of a different type, because
> the keys are typed! Any more than you can overwrite an IORef with a
> value of a different type.
> S
Why is that? Ok, here is my second implementation. It uses the
Title: FM 2003 Call for Tool
Exhibition
Sorry if some of you receive multiple copies of this message.
Stefania Gnesi (FM2003 General Chair)
==
Call for Tool Exhibition
Dear all,
Let C be an omega-category (strict, globular).
Let U be the forgetful functor from strict globular omega-categories
to globular sets. And let F be its left adjoint.
Let us suppose that we are considering an equivalence relation R on UC
(the underlying globular set of C) such that the
You can't overwrite an entry with a value of a different type, because
the keys are typed! Any more than you can overwrite an IORef with a
value of a different type.
S
| -Original Message-
| From: Ralf Hinze [mailto:[EMAIL PROTECTED]
| Sent: 06 June 2003 15:01
| To: Simon Peyton-Jones; Ti
HSX11 1.00
A Haskell binding for X11
In preparation for a major release of HSX11, we are making an alpha
release for folk to play with. We welcome bug reports, comments on
how the system is packaged, the web page, examples, comments from
those wh
Am Freitag, 6. Juni 2003 15:47 schrieb Simon Peyton-Jones:
> Yes, one *could* use dynamic types. But the check would always succeed!
Why is that? If I overwrite an entry with a value of a different type,
then the check fails. I am certainly missing something ...
Cheers, Ralf
___
Green Card 3.01
A Foreign Function Interface Preprocessor for Haskell
In preparation for a major release of Green Card, we are making an
alpha release for folk to play with. This release fixes a bunch
of little details that people commented on in the 3.00 releas
On 2003-06-06 at 08:15BST "Simon Peyton-Jones" wrote:
>
> I forget whether I've aired this on the list, but I'm
> seriously thinking that we should change 'forall' to
> 'exists' in existential data constructors like this one.
You did mention it, and there were several replies. I'd
characterise th
Yes, one *could* use dynamic types. But the check would always succeed!
That suggests a lack in the static type system. It's not surprising:
the soundness depends on the un-forgeability of keys. So it's
reasonable that there should be some language extension. I'm just
looking for the minimal su
Am Freitag, 6. Juni 2003 15:23 schrieb Simon Peyton-Jones:
> Oh bother, I forgot to add that you can of course insert a new value
> with an old key (suitably typed) and have it overwrite. Else, as you
> say, there would not be much point.
>
> Maybe it'd be better to have a separate key-constructio
Oh bother, I forgot to add that you can of course insert a new value
with an old key (suitably typed) and have it overwrite. Else, as you
say, there would not be much point.
Maybe it'd be better to have a separate key-construction function
newKey :: k -> Key k a
instead of having i
> A more concrete way to formulate a problem that I believe to be
> equivalent is this. Implement the following interface
>
>module TypedFM where
> data FM k -- Abstract; finite map indexed by keys
> of type k
> data Key k a-- Abstract; a key of type k, in
| Conjecture: It's impossible to implement RefMonad directly in Haskell
| without making use of built-in ST or IO functionality and without
unsafe or
| potentially diverging code (such as unsafeCoerce).
A more concrete way to formulate a problem that I believe to be
equivalent is this. Implement
I forget whether I've aired this on the list, but I'm seriously thinking
that we should change 'forall' to 'exists' in existential data constructors
like this one. One has to explain 'forall' every time. But we'd lose a
keyword.
"exists" (like "forall" in ghc only) could be used independently in a
> On Fri, Jun 06, 2003 at 09:32:18AM +0100, Simon Peyton-Jones wrote:
> > Yes! Yes! Advice is good!
>
> OK, how about "avoid unsafePerformIO like the plague"?
>
> Why is it the business of the FFI spec to document unsafe uses of
> unsafePerformIO?
I'd like to second Ross here. Advice is good at
On Fri, Jun 06, 2003 at 09:32:18AM +0100, Simon Peyton-Jones wrote:
> Yes! Yes! Advice is good!
OK, how about "avoid unsafePerformIO like the plague"?
Why is it the business of the FFI spec to document unsafe uses of
unsafePerformIO?
___
Haskell maili
Am Freitag, 6. Juni 2003 09:15 schrieb Simon Peyton-Jones:
> I forget whether I've aired this on the list, but I'm seriously thinking
> that we should change 'forall' to 'exists' in existential data constructors
> like this one. One has to explain 'forall' every time. But we'd lose a
> keyword.
O
| classify :: Eq b => [a->b] -> [a] -> [[[a]]]
| classify cs xs = ...
|
| where for each classifying function in cs, I would get the xs
| partitioned accordingly. E.g.
|
| classify [fst,snd] [(1,0), (1,2), (2,0)]
|
| would yield
|
| [ [(1,0), (1,2)], [(2,0)] -- classified by `fst`
|
| Or maybe it would be better to provide some useful guidance? How
about,
|
| To preserve the soundness of the type system, the result of
| unsafePerformIO should always have a monomorphic type. For
| example,
|
| listRef = unsafePerformIO (newIORef [])
|
|
Ralf,
Thanks. I've just retrieved and read "Scrap your boilerplate" [1]. I must
say that, as a piece of exposition, I think this is an excellent paper
(**). And technically, this is very much the sort of thing I was probing
for. I think I'll focus some attention on gmapM and friends.
(**)
At 20:40 04/06/03 +0200, Tomasz Zielonka wrote:
> Or a variant of Functor constructor class that I have proposed some time
> ago on comp.lang.functional:
>
> class FunctorM t where
> fmapM :: Monad m => (a -> m b) -> (t a -> m (t b))
> fmapM_ :: Monad m => (a -> m b) -> (t a -> m ())
>
31 matches
Mail list logo
