Posts tagged “fp”
Is currying monadic?
Here’s a question that came up while I’ve been trying to implement currying in Perl: is Currying monadic? I’ve tried a couple of times, but not managed to explain what I mean very well on #haskell, so let’s see if a longer writeup explains it better. My simplistic understanding of monads is that they take […]
Currying in Perl
“Currying” is a simple idea that is surprisingly powerful on the one hand, and which was surprisingly hard (at least for me) to get my head around – possibly because the concept didn’t exist natively in the languages I learnt first. When you declare a function in currying style, each argument is taken one at […]
(rough) Grids in Haskell
(This isn’t a full blog post, but a note of a few things about implementing game grids in Haskell). A [[Cell]] structure seems to make sense for a lot of boards. In fact, even the problems I’m looking at might be approached simply indexing into row then col each time you want to access a […]
Functional Pe(a)rls v2 (now with Monads!) at the London Perl Workshop 2008
On Saturday I gave an updated version of my Functional Pe(a)rls talk. This time around I cut the whistlestop tour of builtin FP techniques in Perl (map/grep/join) and added a section on Monads – what they are and how to implement them. I’d originally worried that the slides might have been over-academic and hard to […]