bound VS haste-compiler

First off, I am using Rust. I've begun by implementing an idea that is close in essence to bound, available in this playground. I believe that this is a good first step, but I am concerned with all the recursion leading to stack overflows and that analysing a term under a scope requires eliminating it, which in turn requires full tree traversals. There are ways to optimize the approach (such as caching variable occurrences in each scope node and skipping subtress when a variable I am looking for is not in it) but I wonder how far I can go with this approach and if there’s alternatives.

Has anyone applied this bound Imperative example to a larger language?

Back then, I was using Haste to compile Haskell to JavaScript for the frontend part. But now I fail to properly restore the environment to make the hastec call work. Also, I'm not sure if Haste is still actively maintained.

My ludum-dare 34 entry does have scrolling, and some images which are only visible in some screens but not others. I didn't do any effort to load and unload them as required though, I just keep everything loaded at all times. One potential difficulty is that this game uses Haste to compile Haskell to JavaScript, soI don't know if your framework supports that.

Very cool Dustin. Reminds me (a little) of some work that the Haskell Haste folks were doing to blur the front/backend via the compiler. Interested to see what you learn along the way refactoring hyperfiddle.