[My apologies if you receive multiple copies of this message]
---
C A L L F O R P A P E R S
---
ACM SIGPLAN
2002 Haskell Workshop
On Mon, 4 Mar 2002, Tom Pledger wrote:
> Nguyen Phan Dung writes:
> :
> | mylist :: [Integer]
> | mylist = [1..10]
> |
> | In Hugs, I type mylist to print out all the elements inside. However,
> | after printing about 22000 elements, the system crashs & outputs:
> | "Garbage collec
On Mon, 4 Mar 2002, Jon Fairbairn wrote:
> The current library report defines unionBy like this:
>
> unionBy eq xs ys = xs ++ deleteFirstsBy eq (nubBy eq ys) xs
>
> why does it take the nub of ys, but not xs? I'd have expected
>
> unionBy eq xs ys = (nubBy eq xs) ++ deleteFirstsBy eq (nubB
The current library report defines unionBy like this:
unionBy eq xs ys = xs ++ deleteFirstsBy eq (nubBy eq ys) xs
why does it take the nub of ys, but not xs? I'd have expected
unionBy eq xs ys = (nubBy eq xs) ++ deleteFirstsBy eq (nubBy eq ys) xs
Jón
--
Jón Fairbairn
Antony,
at the given URI it says JDK 1.4 is required, do you know that there
will be problems with 1.3 or is it expected to work with 1.3 also and
just not tested?
Thanks for your help
Marko
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskel
mån 2002-03-04 klockan 15.11 skrev Rijk J. C. van Haaften:
> Hello,
>
> Recently, I wrote a function similar to
>
> x :: a
> x = x 42
>
> which is type-correct (Hugs, Ghc, THIH).
> Still, from the expression it is clear
> that the type shoud have a function type.
It might interest you to know
"Rijk J. C. van Haaften" <[EMAIL PROTECTED]>
wrote:
> Recently, I wrote a function similar to
>
> x :: a
> x = x 42
>
> which is type-correct (Hugs, Ghc, THIH).
> Still, from the expression it is clear
> that the type shoud have a function type.
> The definition
>
> x :: a -> b
> x = x 42
>
>
> Recently, I wrote a function similar to
>
> x :: a
> x = x 42
>
> which is type-correct (Hugs, Ghc, THIH).
> Still, from the expression it is clear
> that the type shoud have a function type.
> The definition
>
> x :: a -> b
> x = x 42
>
> is equally well accepted, though I can't
> see why
CONVITE ESPECIAL.
http://www.repositorio.com.br
Convidamos você a visitar o maior e mais completo site de Informática atualmente na
Internet Brasileira.
São milhares de configurações, scripts, strings de modem, Linux, Windows, Mac, Imac e
outros
ACESSO TOTALMENTE GRATUITO.
São mais de 150
Hello,
Recently, I wrote a function similar to
x :: a
x = x 42
which is type-correct (Hugs, Ghc, THIH).
Still, from the expression it is clear
that the type shoud have a function type.
The definition
x :: a -> b
x = x 42
is equally well accepted, though I can't
see why this type would be corr
Hello,
Recently, I wrote a function similar to
x :: a
x = x 42
which is type-correct (Hugs, Ghc, THIH).
Still, from the expression it is clear
that the type shoud have a function type.
The definition
x :: a -> b
x = x 42
is equally well accepted, though I can't
see why this type would be corr
I am pleased to announce an experimental release of Haven,
a library for scalable vector graphics in Haskell.
Haven provides a wealth of features, including:
- Data types for common geometric shapes such as rectangles,
ellipses and Bezier curves.
- Composition of arbitrary shapes from
I am pleased to announce release 1.1 of GCJNI.
GCJNI is a library that allows Haskell to invoke Java code via the
Java Native Interface (JNI). The implementation uses GreenCard to make
the JNI (a C language interface) available to Haskell. GCJNI includes
a few convenient features, such as:
-
[ Our apologies for multiple copies. ]
==
1st International Workshop on
Foundations of Coordination Languages and
Software Architectures
[ Our apologies for multiple copies. ]
==
1st International Workshop on
Foundations of Coordination Languages and
Software Architectures
===
We apologize if you receive this more than once
===
Second call for papers
Unification in Non-Cla
16 matches
Mail list logo
