Hi all,

This is my first post to this list. Nice to meet you!

I study Functional Programming with Haskell, and I have stuck at p.77 (the first checkpoint in FP, as far as I understand). Passing this, I feel that I make steps towards understanding monadic binding!

So I would like to ask about whether or not this:

P1>>=λu1 ->

P2>>=λu2 ->

P3>>=λu3 ->

P4>>=λu4 ->

return (f u1 u2 u3 u4)

can be rewritten to:

P1>>=(λu1 -> P2>>=(λu2 -> P3>>=(λu3 -> P4>>=(λu4 -> return (f u1 u2 u3 u4)))))

I am trying to understand what is the f in p>>=f in each one of above sequencing applications?

So >>= gets you in this structure (is this the monad?), and return is the gate out of it?

Best regards.

These are my first steps to FP!

--

Angelos Bimpoudis

Doctoral Researcher, Pervasive Computing [p-comp.di.uoa.gr]

SDE, Nessos IT S.A. [www.nessos.gr]

(m): +306942075153