Wow, talk about Baader Meinhof. I’ve spent the last few days hacking out a FOSS Mathematica impl + jupyter kernel, and I’m trying to keep as much of the semanti

Wow, talk about Baader Meinhof. I’ve spent the last few days hacking out a FOSS Mathematica impl + jupyter kernel, and I’m trying to keep as much of the semantics and stdlib as possible defined inside the interpreted runtime, so I can have a small Haskell core and avoid the verbosity of defining builtins in the interpreter. However... it’s slow as hell, and I was wondering if I could implement some kind of bytecode compiler to cache results. It looks like this does exactly that, by tagging cells as symbolic or constant, and replacing them on the fly. Hmmm.