4 ms·
This paper (storage combinators are talked about in the slides) https://2019.splashcon.org/details/splash-2019-Onward-papers/7/Storage-Combinators https://2019.
by bsaul 7y ago
This paper (storage combinators are talked about in the slides) https://2019.splashcon.org/details/splash-2019-Onward-papers/7/Storage-Combinators https://2019.splashcon.org/details/splash-2019-Onward-papers... is absolutely insane. It's perfectly readable, has numerous concrete examples, i love it.
My only problem with the presented technique is that it requires a highly dynamic runtime environment, and so we would be back to abandoning compile-time type safety.
Has there been any attempt to port the idea of storage combinators to compile-time type-safe programming languages ?
- mpweiher 7y agoThanks! I haven’t yet made any credible attempt at typing this, my first priority was trying to get it to work and understand it. And while currently a highly dynamic system is required, I don’t believe this is inherent, it’s just that this stuff is different enough from current practice that you need something dynamic enough to allow the deviation. Now that it’s working, I have started to look more closely at typing it. I think it should be possible. As a matter of fact, SCs and PIs should actually make things more static, because the combinators are configured once and then pretty much used as-is. Any help gladly accepted and appreciated.