comp.lang.haskell Google Group

why does this not work??? monoids and stuff...

jon.gallagher...@gmail.com (jon.gallagher.04) — Mon, 29 Вер 2008 22:51:12 UT

I would like to thank this community for answering my off the wall
questions in the past, comp.lang.haskell has been quite helpful to me
in learning haskell, but also functional programming. Here comes
another.
In a paper by Mark Jones "Functional Programming with Overloading and
Higher-Order Polymorphism" he (re)defines the monoid class

Why my list function eats memory?

grap...@gmail.com (Paul Graphov) — Sun, 28 Вер 2008 12:30:37 UT

Hello haskellers,
I am writing a little program and I need a function that will convert
a list of some values into the list of overlapping windows, for
example, for window size 4:
[1, 2, 3, 4, 5, 6, 7, 8, 9, 10,......] -> [[1, 2, 3, 4], [3, 4, 5, 6],
[5, 6, 7, 8], [7, 8, 9, 10],......]
Windows must overlap by one half and input list is always infinite.

[AD] Book: Haskell School of Expression by Paul Hudack

danielklei...@gmail.com (Daniel Klein) — Sat, 27 Вер 2008 12:26:54 UT

I've got a brand new, mint condition, copy of this book that I don't want.
I am asking $20 (this is more than 50% off the Amazon list price) + $4
bookrate shipping to anywhere in the continental U.S.
If you are interested then please reply to my gmail address. First come
first served.
This message will not repeat.

help with maybe, dropUntil xs pred

circularf...@gmail.com (process) — Sun, 21 Вер 2008 01:59:23 UT

dropUntil :: [(Maybe a, b)] -> (b -> Bool) -> Maybe a
dropUntil [] _ = Nothing
--dropUntil [x] _ = fst x
dropUntil (x:xs) pred = if pred (snd x) then fst x
else dropUntil xs pred
i still dont get how to use maybe.
how would i call this function?
i used it like this first which works for what i want but the function

How to use Data.Map?

awe...@gmail.com (Aidan) — Fri, 19 Вер 2008 02:13:54 UT

Hello haskellers,
I have a question relating to the use of Data.Map. I admit I havn't
fully understood all the concepts of functional programming yet, and
thus am having trouble understanding how one might employ the Data.Map type.
Consider the following python code:
===============
combos = dict()

An idea about functional colors

jon.gallagher...@gmail.com (jon.gallagher.04) — Mon, 15 Вер 2008 19:50:19 UT

{-
I am (sort of) new to Haskell, as well as programming, but love
Haskell. I decided that the best way for me to learn my way around is
to just play with the language a bit. I thought of a problem that
could potentially bring a lot of the principles of the language out,
and would love comments and suggestions on making it better. The

<< FREE HELP DESK SOFTWARE >>

rose...@gmail.com — Sun, 14 Вер 2008 09:52:44 UT

============================== ======
[link]

Difficulty deriving a general type for combinator

s.r.clarkst...@dunelm.org.uk (Simon Richard Clarkstone) — Sat, 13 Вер 2008 00:22:57 UT

Suppose I have a set of functions like these:
2app_id_maybe :: (forall a. a -> Maybe a) -> (b,c) -> (Maybe b,Maybe c)
2app_id_maybe f (x, y) = (f x, f y)
2app_maybe_id :: (forall a. Maybe a -> a) -> (Maybe b,Maybe c) -> (b,c)
2app_maybe_id f (x, y) = (f x, f y)
2app_id_list :: (forall a. a -> [a]) -> (b, c) -> ([b], [c])

job advert: senior role at Credit Suisse

ganesh.sittampa...@gmail.com (Ganesh Sittampalam) — Fri, 12 Вер 2008 22:30:34 UT

[I apologise if this is off-topic for either of comp.lang.functional
or comp.lang.haskell - in the former case I was unable to find a
charter at all, and in the latter case I could only find a draft
charter that didn't mention job ads either way]
Credit Suisse is seeking to recruit an expert in functional

Workshop on Generic Programming: Call for Participation (co-located w/ ICFP08)

icfp.public...@googlemail.com (Matthew Fluet (ICFP Publicity Chair)) — Fri, 12 Вер 2008 14:19:57 UT

Dear all,
the Workshop on Generic Programming is only a few days away: 20th
September 2008 ([link]).
==> Invited talk: The Generic Paradigm
==> Lambert Meertens (Utrecht University)
==> We have reserved 20 minutes for *lightning talks*. If you plan to
==> attend and if you would like to give a short talk (about half-

haskell and web programming -- beating LAMP

gavcom...@gmail.com (gavino) — Fri, 12 Вер 2008 02:19:55 UT

can haskell wash or happs etc outdo lamp?

Help with constraining with Type Classes?

daucl...@gmail.com — Thu, 11 Вер 2008 15:46:49 UT

Hello, I'm working on constraining some collection types (particularly
types of zippers) with type classes. The type classes assume they are
working with containing types, but then, I'm having difficulty
describing that for the generic types.
To be specific, I have a Zipper:
where |dir| is the the "dir"ection (type) by which one can move about

ICFP09 Announcement

icfp.public...@googlemail.com (Matthew Fluet (ICFP Publicity Chair)) — Tue, 02 Вер 2008 14:08:21 UT

+----------------------------- ------------------------------ ---------+
ANNOUNCEMENT
The 14th ACM SIGPLAN International
Conference on Functional Programming
ICFP 2009
31st August - 2nd September 2009

How to turn list into iterator ?

manu....@gmail.com — Tue, 02 Вер 2008 07:36:03 UT

Sorry for the typo in my previous post. Nothing to deal with Turing,
except it 's about computer.

How to turing list to iterator

manu....@gmail.com — Mon, 01 Вер 2008 21:05:17 UT

I am trying test the way control memory allocation in lazy list.
Consider the following program:
-- start of code
module Main where
intTo :: (Num a, Num b)=> a->b -> [a]
intTo _ 0 = []
intTo from n = from : (intTo (from+1) (n-1))
test1 :: IO ()
test1 = do
let
l1=intTo 0 1000000
l2=intTo 0 1000000