{"shas":[["86fac69b29a3983d90bfbd838d57ad5781a5d655","ca52830902e3c33feb21efcaaa89ea8c0a9c1b3b@ecs.vuw.ac.nz","Bug fix for the way headers are identified.","DavePearce"],["f5c369a4b77e97f46bccebbc59f55e43456bffdb","ca52830902e3c33feb21efcaaa89ea8c0a9c1b3b@ecs.vuw.ac.nz","Bug fix for normalising nodes in the presence of unions.  However, it's not right yet!","DavePearce"],["b5161264d81a10073700ae860ea387a79b5e8112","ca52830902e3c33feb21efcaaa89ea8c0a9c1b3b@ecs.vuw.ac.nz","Incredible.  I seem to have magically found a much easier way to minimise my types.  This uses a \"subtype matrix\", which I think must be related to the way subtyping is performed by Kozen.","DavePearce"],["ecc8440108aab6810b1a5b916e20531678798f73","ca52830902e3c33feb21efcaaa89ea8c0a9c1b3b@ecs.vuw.ac.nz","Bug fix for the minimisation algorithm.  Was thinking about the relationship with graph isomorphism.  One problem I can foresee is that applying my minimisation algorithm on cubic graphs would not be able to distinguish any node ... which is an issue since this would mean the structure wasn't properly considered.  I'm unsure whether or not this is a real problem, given the context of subtyping compared with graph isomorphism.","DavePearce"],["0e86b416f5a1824ac59243ba0cc332d65906a331","ca52830902e3c33feb21efcaaa89ea8c0a9c1b3b@ecs.vuw.ac.nz","Well I fixed a number of bugs; but, there are some outstanding.  Still, the code is getting close to being very much the best structural subtyping implementation I've developed thus far.","DavePearce"],["36336a10a806e9a8aa8bbc402c1ab3731f4133ed","ca52830902e3c33feb21efcaaa89ea8c0a9c1b3b@ecs.vuw.ac.nz","Ok, zapped another bug.  It seems to be working rather well now ... woo hoo!","DavePearce"]],"repo":"DavePearce/Whiley","actor":"DavePearce","ref":"refs/heads/master","size":6,"head":"36336a10a806e9a8aa8bbc402c1ab3731f4133ed","actor_gravatar":"626b627122ac22614a6d64e5efd79fb8","push_id":26113956}