Dear Colleagues,
I apologize if you receive multiple copies of this message
and would be grateful if you could distribute the Summer School
Call For Participation given below
Best regards,
S. Sousa
--
Hi,
I'm the developer and keeper of FranTk and TclHaskell.
I note Simon PJ suggested you have a look at FranTk.
It's the more powerful of the two and provides good support
for structuring programs. (It's built on top of TclHaskell.)
I spent the summer working with the GHC group on it.
TclHaskel
S.D.Mechveliani wrote:
| partition1 p xs = (filter p xs, filter (not . p) xs)
:
| and optimized implementations, like, say,
|
| partition2 p = foldr (\x (ys, zs) -> if p x then (x:ys,zs) else (ys,x:zs))
|([],[])
|
| may be not equivalent.
Why is this an opti
Joe Fasel <[EMAIL PROTECTED]> writes on 19 Jan 2000
on partition and lifted products
that
partition1 p xs = (filter p xs, filter (not . p) xs)
(is this the recent standard description of `partition' ?)
and optimized implementations, like, say,
partiti
Try FranTk.
http://www.haskell.org/FranTk/
There are other pointers at haskell.org too.,
Simon
