Felleisen, M., M. Wand, D. Friedman, and B. Duba: Abstract Continuations: A Mathematical Semantics for Handling Full Functional Jumps, Proc. 1988 ACM Conf. on Lisp and Functional Programming, pp. 52-62, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of a delimited context [C[ by means of a function whose codomain is not the final domain of Answers. Such functions can thus be composed. Our approach continues the one from [Felleisen et al. 87] and [Felleisen 88] where an extended # calculus and a new SECD like machine were defined, and [Felleisen et al. 88] which presents an algebraic framework where continuations are defined as a sequence of frames and their composition as the dynamic concatenation of these sequences. The present paper describes a more lexical vision of composable continuations, that can be given statically a type. We describe a ....

....the case of a capture. Shifting consists of capturing # and resetting the continuation. The environment is extended with a function that will apply the captured continuation to its argument, stacking the then current continuation on top of #. This realizes composing the two continuations. Unlike [Felleisen et al. 88] the extent of a captured context is never expanded, just like the environment part of a functional closure in a lexically scoped language is fixed at the time of its creation. This aspect is treated in section 6. At this point, we can prove the assertion of the introduction that if the ....

[Article contains additional citation context not shown here]

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba: Abstract Continuations: A Mathematical Semantics for Handling Full Functional Jumps. In Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, Snowbird, Utah (July 1988).

....be pushed on the meta continuation or it can be discarded. Pushy continuations, to some extent, can be composed. Felleisen 87] and [Felleisen et al. 87] introduce the idea to compose reified continuations, in a term rewriting setting. This view is developed in [Felleisen 88] and culminates in [Felleisen et al. 88] with an algebraic framework where continuations are defined as sequences of frames and their composition 4 as concatenation. However, resulting programs cannot be given statically a type, unless a trivial one. The reason is that composing continuations is made on a dynamic basis, so that ....

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, Bruce F. Duba: Abstract Continuations: a Mathematical Semantics for Handling Full Functional Jumps, proceedings of the 1988 ACM Conference on Lisp and Functional Programming pp 52-62, Snowbird, Utah (July 1988)

....new operators is to abstract control with regular procedures that do not escape when they are applied. This approach encourages seeing not only procedures as the computational counterpart of functions but extending this view to continuations as well. However, the published semantic descriptions, Felleisen et al. 88] do not actually represent continuations as functions but as concatenable sequences of activation frames, losing the inherent simplicity of the original functional formalism. Does this mean that control operators substantially more powerful than jumps are indeed beyond the limit of a traditional ....

....this makes the semantics order dependent, comparably to converting a meta circular interpreter containing shift and reset only once. The approach is changed in [Johnson Duggan 88] where continuations are composed by appending their representation, precisely as with the control operator in [Felleisen et al. 88] Further, since a continuation represents a context, context delimiters have been introduced in [Felleisen 88] as prompts. In our framework, a prompt naturally is the direct style counterpart of initializing the continuation of a CPS program with the identity function. Formal descriptions of ....

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, Bruce F. Duba: Abstract Continuations: A Mathematical Semantics for Handling Full Functional Jumps, proceedings of the 1988 ACM Conference on Lisp and Functional Programming pp 52-62, Snowbird, Utah (July 1988)

No context found.

Felleisen, M., M. Wand, D. Friedman, and B. Duba: Abstract Continuations: A Mathematical Semantics for Handling Full Functional Jumps, Proc. 1988 ACM Conf. on Lisp and Functional Programming, pp. 52-62, 1988.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC