Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re^10: 99 Problems in Perl6

by gaal (Parson)
on Dec 16, 2006 at 07:31 UTC ( #590176=note: print w/replies, xml ) Need Help??

in reply to Re^9: 99 Problems in Perl6
in thread 99 Problems in Perl6

Pure variants like this one are desugared into a case:

compress x = case x of [] -> [] [a] -> [a] -- singleton list (x:y:xs) -> (if x == y then [] else [x]) ++ compress (y:xs)

And can do no monadic monkey business because compress is pure. In this they are simply a more convenient way of spelling out some branches. You wouldn't say if is a sneaky way of doing sequential dependencies, would you?

Sure, with a monadic function you can also have pattern guards that do monadic stuff, but I don't think you can bind without noticing, and in any case the function type will tell you it's monadic.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://590176]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (8)
As of 2018-05-28 10:50 GMT
Find Nodes?
    Voting Booth?