On behalf of the many, many contributors, I am pleased to announce
that the
Haskell Communities and Activities Report
(17th edition, November 2009)
http://www.haskell.org/communities/
is now available from the Haskell Communities home page in PDF
===
CALL FOR PARTICIPATION
ACM SIGPLAN 2010 Workshop on
Partial Evaluation and Program Manipulation (PEPM'10)
Madrid, January 18-19, 2010
(Affiliated with
Dear all,
so much has happened in the Haskell world in the past months.
Therefore, I would like to collect contributions for the 17th
edition of the
Haskell Communities Activities Report
2009/5/24 Petr Pudlak d...@pudlak.name:
If all Haskell had would be HM, it would be System F.
That cannot be quite right, can it? System F has more powerful
polymorphism than HM.
Ciao,
Janis.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
International Summer School on Advances in Programming Languages
25th-28th August, 2009
Heriot-Watt University, Edinburgh, Scotland
http://www.macs.hw.ac.uk/~greg/ISS-AiPL
Overview
This four-day residential International Summer School on Advances in
information can be found in the original Call for Contributions at
http://www.haskell.org/pipermail/haskell/2009-April/021180.html
I look forward to receiving your contributions.
Thanks a lot,
Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:vo...@tcs.inf.tu
information can be found in the original Call for Contributions at
http://www.haskell.org/pipermail/haskell/2009-April/021180.html
I look forward to receiving your contributions.
Thanks a lot,
Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:vo...@tcs.inf.tu
Hi,
I arrived in Savannah yesterday (to attend PADL), and have spent the
most part of the day drifting aimlessly around. Thrilling as that may
be, I thought perhaps there might be other members of the Haskell
community around,
I will be, in about three hours.
Plans for tonight: sleeping
Hi Dmitri,
I don't have answers for all your questions. But some, at least.
--- Dmitri O.Kondratiev [EMAIL PROTECTED] wrote:
-- Ok, then I can
derive MyOrd class directly from Ord:
class Ord a = MyOrd a where
(%), (%=), (%), (%=) :: a - a - Bool
x % y = x y
x %=
y =
consequences when
the type in question is later instantiated with, say, Int (or whatever). See
numerous examples in:
http://wwwtcs.inf.tu-dresden.de/~voigt/seqFinal.pdf
Ciao,
Janis Voigtlaender.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org
--- Huazhi (Hank) Gong [EMAIL PROTECTED] wrote:
Thank you very much
for introducing tail recursion.
It's my first time to hear this. :)
However, I'm wondering whether every loop structure from C like language can
be translated to this kind of tail recursion?
Yes, as discovered by
John
--- [EMAIL PROTECTED] wrote:
Jerzy Karczmarczuk wrote:
OK, I think
that this subject matured enough to rest in peace...
I would have to
agree with that, although...
Since the subject is not going to rest, why
not also jump in?
Well, each partial list is finite.
I think quite
a few
--- [EMAIL PROTECTED] wrote:
[EMAIL PROTECTED] wrote:
1:_|_
is certainly finite. In what sense is it not?
I see that point. I have
been using finite as, by convention, equal to total and finite. And so
have others. As always with convention, one can argue. I won't, of course.
Sorry, see my
--- Matthias Fischmann [EMAIL PROTECTED] wrote:
On Thu, Jun 22,
2006 at 09:22:34AM +0100, Simon Peyton-Jones wrote:
To: Brian Hulley
[EMAIL PROTECTED], Joel Reymont [EMAIL PROTECTED]
Cc: haskell-cafe@haskell.org
From: Simon Peyton-Jones [EMAIL PROTECTED]
Date: Thu, 22 Jun
2006 09:22:34
--- Cale Gibbard [EMAIL PROTECTED] wrote:
As an example of this sort
of thing, I know that there are only 4
values of type a - Bool (without
the class context). They are the
constant functions (\x - True), (\x -
False), and two kinds of
failure (\x - _|_), and _|_, where _|_ is pronounced
15 matches
Mail list logo
