Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In Robert (Corky) Cartwright, editor, Proceedings of the 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....captured context to retain only the binding structure (E 2 ) whereas Felleisen et al. s semantics exhibits the behaviour of our # c , eagerly substituting out bindings and leaving only the control structure (E 1 ) to be captured. Another interesting connection is between abstract continuations [FWFD88] as used by Queinnec [Que93] and the reduction contexts E 3 used in our operational semantics. Each A 1 or A 2 corresponds to a frame of the continuation, except that the semantics of ACPS substitutes the A 2 binding frames away. Gunter et al. GRR95] have studied # and in a typed setting. ....

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In ACM Conference on LISP and Functional Programming, Snowbird, Utah, pages 52--62, July 1988. 83

....captured context to retain only the binding structure (E2 ) whereas Felleisen et al. s semantics exhibits the behaviour of our # c , eagerly substituting out bindings and leaving only the control structure (E1 ) to be captured. Another interesting connection is between abstract continuations [FWFD88] as used by Queinnec [Que93] and the reduction contexts E3 used in our operational semantics. Each A1 or A2 corresponds to a frame of the continuation, except that the semantics of ACPS substitutes the A2 binding frames away. Gunter et al. GRR95] have studied # and in a typed setting. It ....

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In ACM Conference on LISP and Functional Programming, Snowbird, Utah, pages 52--62, July 1988.

....that every structure created is automatically fully persistent (accessible and modifiable) Persistent data structures arise not only in functional programming but also in text, program, and file editing and maintenance; computational geometry; and other algorithmic application areas. See [6, 9, 11, 10, 13, 12, 14, 15, 18, 24, 25, 26, 27, 28, 29, 30]. Several papers have dealt with the problem of adding persistence to general data structures in a way that is more efficient than the obvious solution of copying the entire structure whenever a change is made. In particular, Driscoll, Sarnak, Sleator, and Tarjan [13] described how to make ....

M. Felleisen, M. Wand, D. P. Friedman, and B. F. Duba. Abstract continuations: a mathematical semantics for handling full functional jumps. In Proc. Conference on Lisp and Functional Programming, pages 52--62, 1988.

....side effects, has the property that every structure created is automatically fully persistent. Persistent data structures arise not only in functional programming but also in text, program, and file editing and maintenance; computational geometry; and other algorithmic application areas. See [6, 10, 11, 12, 13, 14, 15, 16, 24, 37, 38, 39, 40, 41]. A number of papers have discussed ways of making specific data structures, such as search trees, persistent. A smaller number have proposed methods for adding persistence to general data structures without incurring the huge time and space costs of the obvious method, which is to copy the ....

....[4, 13] In addition to being an interesting problem in its own right, our data structure provides a way to add fast catenation to list based programming languages such as scheme, and to implement sophisticated programming constructs based on continuations in functional programming languages. See [15, 16]. A key ingredient in our result is an algorithmic technique related to the redundant digital representations devised to avoid carry propagation in binary counting. The remainder of this paper consists of six sections. Section 2 surveys previous work dealing with problems related to that of ....

M. Felleisen, M. Wand, D. P. Friedman, and B. F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In Proc. Conference on Lisp and Functional Programming, pages 52--62, 1988.

....there has been considerable development of persistent data structures. Persistent data structures have important applications in various areas such as functional programming; text, program, and le editing and maintenance; computational geometry; and other algorithmic application areas. See [3, 4, 5, 8, 9, 10, 11, 12, 14, 22, 23, 24, 25]. DSST developed ecient general methods to make pointer based data structures partially or fully persistent. These methods support updates that apply to a single version of a structure at a time, but they do not accommodate operations that combine two di erent versions of a structure, such as ....

M. Felleisen, M. Wand, D. P. Friedman, and B. F. Duba. Abstract continuations: a mathematical semantics for handling full functional jumps. In Proc. Conference on Lisp and Functional Programming, pages 52-62, 1988.

....extensions are as follows: representation for expressions to be evaluated concurrently by processes (as in CML [23] the notion of rst class contexts [17] and representation for transparent migration. In order to model transparent migration, we use the notion of partial continuations [9, 7]. Then, execution states of programs are abstracted as partial continuations [26, 27] In mv calculus, a network state is represented as a set of hosts each of which is a pair of a host name and a set of processes. Contexts are registered with hosts (we identify MML servers with hosts in this ....

M. Felleisen, M. Wand, , D. P. Friedman, and B. F. Duba. Abstract Continuations: A Mathematical Semantics for Handling Full Functional Jumps. In ACM Conference on Lisp and Functional Programming, pages 52-62, 1988.

....can be performed like removing intermediate data structures produced by one frame for the other, removing needless computations or, precomputing ready redexes. The technique crucially depends on a program transformation which is the direct and immediate counterpart of abstract continuations [FWFD88] Abstract continuations were invented to denote elaborate control operators. Abstract Continuation Passing Style represents continuations by lists of frames. Each frame waits for a value as well as the list of frames that are below it; when invoked it usually transforms the value into a result ....

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce Duba. Abstract continuations: a mathematical semantics for handling functional jumps. In Proceedings of the 1988 ACM Symposium on LISP and Functional Programming, Salt Lake City, Utah., July 1988.

....[26] 27] Danvy and Filinski [3] For the purpose of the proof, we had to specialise our CPS translation but the applicability of this approach in other circumstances does not appear to be immediate. The mechanism of prompt introduced in section 6 is essentially di erent from Felleisen s prompt [4], or Danvy and Filinski s reset [2] or Queinnec and Serpette s splitter facility [24] In their approach, a prompt is used to delimit a partial continuation while we use the prompt to mark the extent of callcc. Jouvelot and Gi ord [14] present a static analysis of programs with call cc. Their ....

M. Felleisen, M. Wand, D. P. Friedman, and B. F. Duba. Abstract Continuations : A Mathematical Semantics for Handling Full Functional Jumps. In Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, pages 52-62, July 1988.

....from a frozen zone since a new frame has to be pushed at FS. The tail recursion property is immediately regained since afterthat calls are performed from a free zone. 6 Related Works Felleisen and others have introduced prompts and partial continuations in a series of paper [Felleisen 88, Felleisen Wand Friedman Duba 88, Sitaram Felleisen 90] Their control operators behave dynamically since control can only abstract control upto the most recent run. We can easily provide these operators: let ( run stack ( set run (lambda (thunk) let ( old rs run stack) begin0 (splitter (lambda (abort call pc) ....

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, Bruce Duba, Abstract Continuations: A Mathematical Semantics for Handling Full Functional Jumps, ACM conference on Lisp and Functional Programming, Snowbird, Utah, July 1988.

....[91] is an important notion for understanding control in programs. Although we have often said like the continuation of a program execution is transmitted on migration , exactly speaking, this continuation in our mobile calculus is not the usual, ordinary continuation, but a partial continuation [29, 34, 35, 56]. An ordinary continuation represents the entire rest of computation: it is a mapping from a value to the final answer, it cannot be invoked more than once, it cannot be composed and the control never returns to the point of invocation unless it is captured by another continuation. But a partial ....

....of the entire program. Remember that the portion to be migrated is denoted by an undock expression hei in our mobile calculus. The notion of partial continuation is closely related to code migration. There are two major slightly different notions of partial continuation, which are Felleisen s [34, 35] and Danvy s [29] Felleisen s notion of partial continuation has the dynamic flavor. It precisely corresponds to the execution stack. In contrast, Danvy s notion has the static flavor. It has an (extended) continuation semantics. Their notions are much alike each other. They coincide in most ....

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba. Abstract Continuations: A Mathematical Semantics for Handling Functional Jumps. In Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, pages 52--62, 1988.

....programs. A second line of related work concerns implementation of various computational paradigms using control operators directly, without involving monads at all. Examples include uses of basic call cc for thread packages [Wan80] and imperative backtracking [HDM93] simple composable control [FWFD88, DF92] for nondeterminism and other basic effects, and a number of proposals for hierarchical control [DF90, SF90, GRR95] to represent general layered e ects. Most of these are based on operational de nitions of the control operators in terms of their actions on evaluation contexts (although many ....

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, pages 52-62, Snowbird, Utah, July 1988.

.... Subcontinuations were first introduced by the authors in an earlier paper, which referred to subcontinuations as process continuations [16] A similar mechanism, developed independently, was described in a later paper by Queinnec and Serpette [22] Our work is based on work by Felleisen, et al. [11, 9, 12]. Johnson and Duggan [18] have developed a notion of partial continuations that also extends traditional continuation control in a similar manner. In a related work, Sitaram and Felleisen [23] introduce techniques to constrain the effects of prompts and functional continuations. They do so, ....

Felleisen, Matthias, Wand, Mitchell, Friedman, Daniel P., and Duba, Bruce F. Abstract continuations: A mathematical semantics for handling full functional jumps. In Proceedings of the 1988 ACM Conference on Lisp and Functional Programming (July 1988) 52--62.

.... more externally towards implementation of an abstract machine that captures control categorically in its varied forms go tos, raising exceptions, handling exceptions, while loops, and more exotic and powerful contexttransformation mechanisms such as Felleisen s prompt and control operators [Fel88, FWFD88, SF90]. A keystone work in this area is Filinksi s SCL category (SCL for symmetric combinatory logic) that expresses several dualities: totality versus strictness of functions, call by name versus callby value evaluation, and values versus continuations [Fil89a, Fil89b] His categorical view of a ....

M. Felleisen, M. Wand, D. Friedman, and B. Duba, Abstract Continuations: A Mathematical Semantics for Handling Full Functional Jumps. In ACM Conference on Lisp and Functional Programming, 1988.

....5 More formal semantics In this section, we provide the definition of a metacircular interpreter for the idiom of Icsla. We will depart from the tradition since the expression to be evaluated is first rewritten using a program transformation based on Abstract Continuation Passing Style (ACPS) FWFD88, Que92b] The resulting expression is evaluated using any regular Scheme interpreter, see for instance [Dyb87] We can thus define our language in a very compressed form with only two key points: a program transformation and a library of functions that are defined in Scheme. This presentation is ....

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce Duba. Abstract continuations: a mathematical semantics for handling functional jumps. In Proceedings of the 1988 ACM Symposium on LISP and Functional Programming, Salt Lake City, Utah., July 1988.

.... 2: Constraints as Closures Abstract Control Abstract control for programming languages in its most general form stems from research in Denotational Semantics whose computational rendition as a higher order formalism (such as the calculus) give explicit first class citizenship to continuations [FWFD88] Thus, Scheme [RC86] is certainly the programming language instance having explored the issue the furthest with its higher order call cc primitive which allows arbitrarily powerful control flow. The simpler exception handling of ML [HMT88] and Modula 2 3 [CDG 89, Rov86] elaborations of ....

Matthias Felleisen, Mitchell Wand, Daniel Friedman, and Bruce Duba. Abstract continuations: a mathematical semantics for handling full functional jumps. In Proceeding of the Conference on Lisp and Functional Programming, pages 52--62, 1988.

.... and computation oriented language already presented in more details and examples in [QD93] Section 2 explains how to systematically implement a concurrent and distributed interpreter for that language, using a set of program transformations combining Abstract Continuation Passing Style (ACPS) FWFD88] and ObjectOriented Lifting. The originality of this implementation is that it chiefly uses objects and generic functions in a style that allows to concentrate the problems related to concurrency and migration of computations into the sole discriminating behavior of generic functions. ACPS is not ....

....forms that already respect our grammar. Such a transformation is already discussed in [FWH92, chap 8] A minor but well known technical problem is that CPS reifies continuation into regular forms which usually must be distinguished from real abstractions, we therefore use Abstract CPS (ACPS) FWFD88] which puts more emphasis on the construction and use of continuations. The form (resume q v) will represent the return of the value v to the continuation q, while (extend q 0 (lambda (q v) will be analogous to pushing a frame onto continuation q 0 . A frame is represented by a ....

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce Duba. Abstract continuations: a mathematical semantics for handling functional jumps. In Proceedings of the 1988 ACM Symposium on LISP and Functional Programming, Salt Lake City, Utah., July 1988.

....example of our technique, we have described an implementation of purely functional catenable lists that support catenation and all other list primitives in constant amortized time. There are many potential applications of this data structure, including the implementation of full functional jumps [6] and support for the Bird Meertens formalism [2, 13] in which append (catenate) is often given preference over cons (push) Other data structures that can be made persistent using our technique include queues and deques [17] and priority queues. Acknowledgements Thanks to Bob Tarjan for ....

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, pages 52--62, 1988.

No context found.

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce Duba. Abstract continuations: A mathematical semantics for handling functional jumps. In Proceedings of the 1988.

....providing contexts in which useful operators can be defined. Danvy and Filinski show that their shift and reset operators can be defined within CPS [5] Queinnec shows that his splitter, abort, and call pc can be defined within what he calls Value Transforming Style [19] based on Abstract CPS [8]. Queinnec cannot use standard CPS as his operators are dynamic and rely on the structure of the stack. An extension of Abstract CPS has been used in the Icsla work cited above. Moggi has presented a transformation to monadic style, extended to operate over languages including j and [16] Cooper ....

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, pages 52--62, Snowbird (Utah USA), July 1988.

No context found.

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In Robert (Corky) Cartwright, editor, Proceedings of the 1988.

No context found.

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In Robert (Corky) Cartwright, editor, Proceedings of the 1988.

No context found.

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In ACM Conference on LISP and Functional Programming, Snowbird, Utah, pages 52--62, July 1988. 83

No context found.

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, pages 52--62, Snowbird, Utah, July 1988.

No context found.

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In ACM Conference on LISP and Functional Programming, Snowbird, Utah, pages 52--62, July 1988.

No context found.

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In Robert (Corky) Cartwright, editor, Proceedings of the 1988.

First 50 documents

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