Let's call the two languages in question (untyped lambda calculus with single or multiple prompt delimited continuations) L_delim and L_prompt.
Is it possible to express multi-prompt delimited continuations in terms of single-prompt delimited continuations
By express I mean the macro-expressible sense (to provide some kind of translation that doesn't involve interpreter overhead), of course it's possible to write an interpreter for multi-prompt delimited continuations even in pure lambda calculus.
I expected a negative result for this, that it's not possible but I don't know how that would be shown. Thanks for any input on this.