Christopher Strachey and Christopher Wadsworth. A mathematical semantics for handling full jumps. Technical Report Technical Monograph PRG--11, Oxford University Computing Laboratory, 1974.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....for converting an arbitrary expression into continuation passing style (CPS) although I didn t call it that at the time. The first reference to CPS of which I am now aware is a 1966 paper by van Wijngaarden [37] CPS was also independently discovered by several others over the next several years [19, 23, 24, 30, 35]. Reynolds [31] pro vides a fascinating historical account of the early discovery and rediscovery of this concept. His paper alerted me to some of the historical references mentioned above. This work was presented in preliminary form at the 1972 ACM Conference on Proving Assertions about ....

Strachey, Christopher and Wadsworth, Christopher P. Continuations, a Mathematical Semantics for Handling Full Jumps. Technical Monograph PRG--11, Oxford University Computing Laboratory (January 1974).

....rwh cs.cmu.edu. Supported by a National Science Foundation Graduate Fellowship. Electronic mail address: mdl cs.cmu.edu. 0 1 Introduction Among the many advances in the theory and practice of programming language design, the concepts of polymorphism [14, 28, 39] and continuation passing [38, 41, 43] are of particular interest. The use of polymorphism in a practical programming language was first explored in ML [15, 28, 29] This style of polymorphism, called implicit polymorphism, is based on the idea that programs are type free, with types interpreted as predicates expressing properties of ....

....a means of enforcing levels of abstraction [40] and as such is primarily concerned with the static structure and properties of programs. Matters of control are elegantly addressed using the method of continuations. The semantics of control operations may be concisely expressed using continuations [9, 36, 38, 42, 43]. Important control constructs such as co routines [21] and user level threads [5, 37] can be defined using primitives for reifying continuations. Conversion into continuationpassing style (CPS) is a useful compilation technique for higher order functional languages [3, 2, 23, 41] ....

Christopher Strachey and Christopher Wadsworth. A mathematical semantics for handling full jumps. Technical Report Technical Monograph PRG--11, Oxford University Computing Laboratory, 1974.

....the formal semantics of future and first class continuations. The semantics is an abstract machine that models a parallel computer with a shared memory. 1 Introduction The continuation of an expression is defined as the computation that remains to be performed after evaluating the expression [22]. Some languages, like Scheme [21, 23] or Standard ML of New Jersey [1] provide the programmer with first class continuations; in these languages, continuations have the same status as numerical values, i.e. they can be passed in argument to or returned by functions, or stored in data structures. ....

Christopher Strachey and Christopher P. Wadsworth. A Mathematical Semantics for Handling Full Jumps. Technical Monography PRG-11, Oxford University Computing Laboratory, Programming Research Group, Oxford, England, 1974.

....in his own treatment of Algol 60 [15] he made no mention of the work when he heard F. L. Morris s colloquium in 1970. See Section 4. Moreover, Christopher Strachey never connected the work with Wadsworth s continuations, and did not cite van Wijngaarden in his own descriptions of the latter [42, 43]. See Section 5. The discussion following the presentation reveals deep philosophical differences between van Wijngaarden and other researchers, particularly van Wijngaarden s abhorrence of abstract syntax and his belief that proper procedures were more basic than functions. A stronger barrier ....

....value. 48] Eventually, Strachey described the ideas in a seminar at the Institut de Recherche d Informatique et d Automatique in May 1973; a written version was published by IRIA [42] and a revised and slightly expanded version appeared as a report of the Oxford Programming Research Group [43]. Specifically, these reports gave a continuation style denotational definition of an imperative language with labels and jumps, including jumps out of blocks embedded within expressions. The texts were mostly written by Strachey, but the underlying method of continuations was due to Wadsworth. ....

Strachey, Christopher and Wadsworth, Christopher P. Continuations, A Mathematical Semantics for Handling Full Jumps. Technical Monograph PRG--11, Oxford University Computing Laboratory (January 1974).

.... to ML First class continuations are an abstraction that evolved from various nonstandard control structures such as Landin s J operator [23] Reynold s escape [31] label variables in Gedanken [30] and PAL [7] and from the semantic analyses of general control structures, including jumps [34]. Scheme [36] originally introduced a binding construct (catch k body) that captured its own expression continuation and bound it to the variable k, with the expression body as the scope of the binding. The continuation represents the rest of the computation, and behaves as a function that takes ....

Christopher Strachey and Christopher Wadsworth. A mathematical semantics for handling full jumps. Technical Report Technical Monograph PRG--11, Oxford University Computing Laboratory, 1974.

.... to ML First class continuations are an abstraction that evolved from various nonstandard control structures such as Landin s J operator [21] Reynold s escape [32] label variables in Gedanken [31] and PAL [7] and from the semantic analyses of general control structures, including jumps [36]. Scheme [38] originally introduced a binding construct (catch k body) that captured its own expression continuation and bound it to the variable k, with the expression body as the scope of the binding. The continuation represents the rest of the computation, and behaves as a function that ....

Christopher Strachey and Christopher Wadsworth. A mathematical semantics for handling full jumps. Technical Report Technical Monograph PRG--11, Oxford University Computing Laboratory, 1974.

....for partial continuations: a context rewriting system and a cps translation. Two new and realistic examples illustrate both the interest of partial continuations and the expressiveness of our choices. 1 Introduction The mathematical concept of continuation was introduced by Strachey and Wadsworth [18] [16] to give a semantics to control operators such as goto. The continuation of an expression represents the rest of the computation to be performed after evaluation of this expression. Some programming languages, such as Scheme and SML of New Jersey, provide the control operator call cc, which ....

Christopher Strachey and Christopher P. Wadsworth. A Mathematical Semantics for Handling Full Jumps. Technical Monography PRG-11, Oxford University Computing Laboratory, Programming Research Group, Oxford, England, 1974. This article was processed using the L a T E X macro package with LLNCS style

....approach is formalised in the PCKS machine, which is proved to be correct by showing that it has the same observational equivalence theory as the sequential semantics. 1 Introduction The continuation of an expression is the computation that remains to be performed after evaluating this expression [16]. Some programming languages like Scheme [14] or SML of New Jersey [1] provide the user with two facilities to act on the interpreter continuation: the capture and the invocation. The capture of a continuation consists in packaging up the current continuation as a first class object so that it ....

Christopher Strachey and Christopher P. Wadsworth. A Mathematical Semantics for Handling Full Jumps. Technical Monography PRG-11, Oxford University Computing Laboratory, Programming Research Group, Oxford, England, 1974. 16 This article was processed using the L a T E X macro package with LLNCS style

.... to ML First class continuations are an abstraction that evolved from various nonstandard control structures such as Landin s J operator [23] Reynold s escape [31] label variables in Gedanken [30] and PAL [7] and from the semantic analyses of general control structures, including jumps [34]. Scheme [36] originally introduced a binding construct (catch k body) that captured its own expression continuation and bound it to the variable k, with the expression body as the scope of the binding. The continuation represents the rest of the computation, and behaves as a function that takes ....

Christopher Strachey and Christopher Wadsworth. A mathematical semantics for handling full jumps. Technical Report Technical Monograph PRG--11, Oxford University Computing Laboratory, 1974.

.... to Standard ML A first class continuation is an abstraction that evolved from various nonstandard control structures such as Landin s J operator [19] Reynold s escape [30] label variables in Gedanken [29] and PAL [7] and from the semantic analyses of general control structures, including jumps [35]. Scheme [37] originally introduced a binding construct (catch x body) that captured its own expression continuation and bound it to the variable x, with the expression body as the scope of the binding. The continuation represents the rest of the computation, and behaves as a function that ....

Christopher Strachey and Christopher Wadsworth. A mathematical semantics for handling full jumps. Technical Report Technical Monograph PRG--11, Oxford University Computing Laboratory, 1974.

....for the call by value ML like strategy only for a restricted sub language in which constructor abstractions are limited to values. 1 Introduction Among the many advances in the theory and practice of programming language design, the concepts of polymorphism [14, 28, 39] and continuation passing [38, 41, 43] are of particular interest. The use of polymorphism in a practical programming language was first explored in ML [15, 28, 29] This style of polymorphism, called implicit polymorphism, is based on the idea that programs are type free, with types interpreted as predicates expressing properties of ....

....a means of enforcing levels of abstraction [40] and as such is primarily concerned with the static structure and properties of programs. Matters of control are elegantly addressed using the method of continuations. The semantics of control operations may be concisely expressed using continuations [9, 36, 38, 42, 43]. Important control constructs such as co routines [21] and user level threads [5, 37] can be defined using primitives for reifying continuations. Conversion into continuation passing style (CPS) is a useful compilation technique for higher order functional languages [3, 2, 23, 41] ....

Christopher Strachey and Christopher Wadsworth. A mathematical semantics for handling full jumps. Technical Report Technical Monograph PRG--11, Oxford University Computing Laboratory, 1974.

No context found.

Christopher Strachey and Christopher Wadsworth. A mathematical semantics for handling full jumps. Technical Report Technical Monograph PRG--11, Oxford University Computing Laboratory, 1974.

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