J. C. Reynolds. The discoveries of continuations. Lisp Symbol. Comput., 6(3):233--247, 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Thunks and the lambda-Calculus - Hatcliff, Danvy (1997) (3 citations) (Correct)
....in terms of the other. Both of Plotkin s simulations rely on continuations a technique used earlier to model the meaning of jumps in the denotational semantics approach to programming languages [33] and to express relationships between memory management techniques [12] among other things [27]. Since Algol 60, however, programming wisdom has it that thunks can be used to obtain a simpler simulation of call by name by call by value. Our aim is to clarify the properties of thunks with respect to Plotkin s We begin by defining a thunk introducing transformation T and prove that ....
John C. Reynolds. The discoveries of continuations. In Talcott [34], pages 233--247.
A Confluent Lambda-Calculus With a Catch/throw Mechanism - Crolard (Correct)
....natural deduction. As usual with control operators, the catch throw mechanism is easier to introduce in the framework of abstract stack machines. Indeed, control operators are aimed to handle the continuation (i.e. the rest of the computation to be performed, see Felleisen at al. 1986; 1987) or Reynolds (1993) for a survey) and precisely, in abstract stack machines, the continuation is represented by the stack. In the remainder of this introduction, we will thus consider two simple extensions of Krivine s abstract machine: the machine and the ct machine. The former is designed for evaluating ....
Reynolds, J. C. (1993). The discoveries of continuations. Lisp and symbolic computation, 6, 233--248.
Thunks and the Lambda-Calculus - Hatcliff, Danvy (1993) (3 citations) (Correct)
....in terms of the other. Both of Plotkin s simulations rely on continuations a technique used earlier to model the meaning of jumps in the denotational semantics approach to programming languages [28] and to express relationships between memory management techniques [10] among other things [25]. However, programming wisdom has it that thunks 1 can be used to obtain a simpler simulation of call by name by call by value. Plotkin acknowledges that thunks provide some simulation properties but states that . these protecting by a techniques do not seem to be extendable to a complete ....
John C. Reynolds. The discoveries of continuations. In Talcott [29], pages 233--247.
Thunks and the Lambda-Calculus - Hatcliff, Danvy (1997) (3 citations) (Correct)
....in terms of the other. Both of Plotkin s simulations rely on continuations a technique used earlier to model the meaning of jumps in the denotational semantics approach to programming languages [33] and to express relationships between memory management techniques [12] among other things [27]. Since Algol 60, however, programming wisdom has it that thunks 1 can be used to obtain a simpler simulation of call by name by call by value. 2 Our aim is to clarify the properties of thunks with respect to Plotkin s classic study of evaluation strategies and continuation passing styles ....
John C. Reynolds. The discoveries of continuations. In Talcott [34], pages 233--247.
Thunks and the Lambda-Calculus - Hatcliff, Danvy (1995) (3 citations) (Correct)
....in terms of the other. Both of Plotkin s simulations rely on continuations a technique used earlier to model the meaning of jumps in the denotational semantics approach to programming languages [33] and to express relationships between memory management techniques [12] among other things [27]. Since Algol 60, however, programming wisdom has it that thunks 1 can be used to obtain a simpler simulation of call by name by call by value. 2 Our aim is to clarify the properties of thunks with respect to Plotkin s classic study of evaluation strategies and continuation passing styles ....
John C. Reynolds. The discoveries of continuations. In Talcott [34], pages 233--247.
A Reflection on Call-by-Value - Sabry, Wadler (1996) (18 citations) (Correct)
....of category theory. In particular, we were motivated by noting the close resemblance between the notion of equational correspondence in Sabry and Felleisen [1993] and the properties of an adjunction. Related Work. Like the wheel, CPS is such an excellent idea that it was reinvented many times [Reynolds 1993]. Two formalizations are due to Fischer [1972] and Plotkin [1975] It was proposed as a basis for compiler construction by Steele [1978] and subsequently exploited by Kranz et al. 1986] Appel [1992] and others. One might hope that the variant CPS translation of Fischer [1972] is also a ....
Reynolds, J. C. 1993. The discoveries of continuations. Lisp Symbol. Comput. 6, 3/4, 233--247.
Protothreads - Lightweight, Stackless Threads in C - Dunkels, Schmidt (2005) (Correct)
No context found.
J. C. Reynolds. The discoveries of continuations. Lisp Symbol. Comput., 6(3):233--247, 1993.
Using Protothreads for Sensor Node Programming - Dunkels, Schmidt, Voigt (2005) (1 citation) (Correct)
No context found.
J. C. Reynolds. The discoveries of continuations. Lisp Symbol. Comput., 6(3):233--247, 1993.
Hierarchical Contextual Reasoning - Autexier (2003) (Correct)
No context found.
Reynolds, J. C. (1993). The discoveries of continuations. Lisp and Symbolic Computation, 6.
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