This is great, I haven't been introduced in the notion of supercompiliation. Reading the papers you've listed and going through GRIN's paper [1] it ticks the boxes in terms of laziness and graph reduction. To keep the implementation of Fuse simple I've decided on using strict evaluation of GRIN programs instead of laziness, with my assumption that it would harder to debug/reason on the program. However, this was one of my next improvements: switching to a lazy evaluation with similar semantics to Haskell programs.
> It appears that Fuse does not have user-defined operators. Am I right?
Not yet, but I left this mechanism completely open. As operators are defined as type classes with their signs as method definitions.
> It appears that Fuse does not have user-defined operators. Am I right?
Not yet, but I left this mechanism completely open. As operators are defined as type classes with their signs as method definitions.