Working on a completely new type implementation which should make life easier (hopefully).  The main difference is that it represents types effectively as graphs, rather than recursive trees.  This is helpful for dealing with cycles, since it eliminates the special recursive and leaf nodes which cause so much trouble.
Working on a completely new type implementation which should make life easier (hopefully).  The main difference is that it represents types effectively as graphs, rather than recursive trees.  This is helpful for dealing with cycles, since it eliminates the special recursive and leaf nodes which cause so much trouble.

hjwylde/whiley-compiler,hjwylde/whiley-compiler,hjwylde/whiley-compiler,hjwylde/whiley-compiler,Whiley/WhileyCompiler,hjwylde/whiley-compiler