6 ms·
Out of curiosity, do you have any documentation on reifying and reflecting continuations in pure concatenative languages? I did some preliminary work in this di
by MostAwesomeDude 13y ago
Out of curiosity, do you have any documentation on reifying and reflecting continuations in pure concatenative languages? I did some preliminary work in this direction a bit ago, but found that the pure concatenative languages, like Joy, don't actually have continuations (delimited or undelimited) with the flexibility that I'd like, and Factor's continuations aren't pure. Factor cheats in order to get its stack effects to line up, with a separate continuation stack.
Additionally, if you've managed to crack this puzzle, I'd love to see some documentation accompanying FJS, because it is a major omission from the concatenative literature and nobody seems to actually have anything to read besides the shift/reset white papers.
- mchahn 13y agoI don't know what a pure continuation is so I'll have to do a bit of studying to find out what I have. I'll let you know when I have an answer. You've really gotten my curiosity up now. I don't know how long discussions work on old HN items. If we get cut off I'll continue the discussion on the FJS github issues page.
- commentzorro 13y agoI would also like to know what a "pure continuation" is. Would you post a link or two that explains pure vs non-pure continuations? I've had no luck with web searches.