Monad.Reader article (Multiset partitions)

I imagine that most who read this blog have already seen it, but for those who haven’t, my article Generating Multiset Partitions has been published in Issue #8 of The Monad.Reader.  In it, I discuss the problem of generating multiset partitions in a functional context, and give an implementation in Haskell.  The final published version contains many major improvements over the draft version I posted here a while ago; give it a read and let me know what you think if you’re interested!


About Brent

Associate Professor of Computer Science at Hendrix College. Functional programmer, mathematician, teacher, pianist, follower of Jesus.
This entry was posted in haskell, math, writing and tagged , , , , . Bookmark the permalink.

2 Responses to Monad.Reader article (Multiset partitions)

  1. Rathmann says:

    I just wanted to thank you for writing this piece and making it
    available online. I have recently been implementing similar
    functionality in Python – it should be in the next release of Sympy.

    I went the imperative route and followed Knuth for the actual
    algorithm, but your set up of the problem was extremely helpful,
    especially the discussion of vector partitions and the ordering
    relation on them.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.