Skip to content
August 20, 2009 / cdsmith

Flow Equivalence Code in Haskell

I’ve talked about this code for a few blog entries… so in case anyone was interested in seeing the end result:

There it is.  The main function of interest is canonicalForm, defined at the very end.  This is a computational version of Franks’ construction of canonical forms of flow equivalence classes.  Sorry about the GPL license; it was to avoid an argument, and it’s unlikely this would ever be commercially useful anyway.

One Comment

Leave a Comment
  1. Anonymous / Nov 25 2009 1:21 am

    useless!!!!!the information is not complete!!!

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 )

Google+ photo

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

Connecting to %s


Get every new post delivered to your Inbox.

Join 82 other followers

%d bloggers like this: