Gerald Jay Sussman and Guy Lewis Steele Jr. Scheme: an interpreter for extended lambda calculus. MIT Arti cial Intelligence Memo 349, MIT, December 1975.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....from Erlang programming style: in Erlang a receive means handle a message and then return, but erl receive means this process state is complete here is the next one. This is an important point for programming with Distel, and leads to writing Emacs processes in continuation passing style [5] [6], where what to do afterwards is given explicitly to erl receive instead of relying on the stack. Because erl receive doesn t return, and nor do functions that call it, they should only be tail called called as the last thing a function does. This rule is made explicit in Distel programs by ....

Gerald Jay Sussman and Guy Lewis Steele Jr. Scheme: An interpreter for extended lambda calculus. AI Memo 349, MIT AI Lab, December 1975.

....language to embrace first class escape procedures, from which all known sequential control structures can be synthesized. A few of these innovations have recently been incorporated into Common Lisp, while others remain to be adopted. Background The first description of Scheme was written in 1975 [48]. A revised report [44] appeared in 1978, which described the evolution of the language as its MIT implementation was upgraded to support an innovative compiler [41] Three distinct projects began in 1981 and 1982 to use variants of Scheme for courses at MIT, Yale, and Indiana University [30, 23, ....

Gerald Jay Sussman and Guy Lewis Steele, Jr. Scheme: an interpreter for extended lambda calculus. MIT Artificial Intelligence Memo 349, December 1975.

....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. First class continuations are useful ....

Gerald Jay Sussman and Guy Lewis Steele, Jr. SCHEME: an Interpreter for Extended Lambda Calculus. Technical Report 349, MIT AI Lab, December 1975.

....on Lisp and Functional Programming. c fl1988 Association for Computing Machinery. 1 Introduction and terminology Scheme[15] is nearly an object oriented language. This should come as no surprise, since Scheme was originally inspired by Actors, Hewitt s messagepassing model of computation[22, 1]. Steele has described the relationship between Scheme and Actors at length[19] We take advantage of this relationship and we try not to duplicate functionality that Scheme already provides to add full support for object oriented programming. Our extensions are in keeping with the spirit of ....

Gerald Jay Sussman and Guy L. Steele, Jr. "Scheme: an interpreter for extended lambda calculus." MIT AI Memo 349, 1975.

....Evaluation instruments will assess the effectiveness of Scheme as a first programming language and the utility of the curricular materials developed by this project. 1 Introduction The Scheme programming language was initially designed at MIT to support research in programming languages [19]. The same remarkable combination of simplicity and power that has made Scheme one of the most popular research languages also makes it an excellent language for instruction. One of the earliest instructional uses of Scheme was in Friedman s undergraduate course in programming languages at Indiana ....

Gerald Jay Sussman and Guy Lewis Steele Jr. Scheme: an interpreter for extended lambda calculus. MIT AI Memo 349, Massachusetts Institute of Technology, Cambridge, Mass., December 1975.

....waiting coroutine, the flow of control is structured by the loop statement in the case of iters. 3. 5 Blocks, Closures, and Lambda Expressions Traditionally, iteration abstraction is supported in object oriented languages by providing anonymous blocks [4] lambda expressions [1] or closures [13]. The container classes provide methods to apply a block to all or part of their elements. The execution of such block based iterations is controlled by the container class. With iters, the control is shared by the iter and the calling loop. For example, either the iter or the loop body may abort ....

Gerald J. Sussman and Guy L. Steele Jr. Scheme: An interpreter for Extended Lambda Calculus. Technical Report Artificial Intelligence Memo 349, MIT, December 1975.

....and visualizing executions. A second prototype, with an improved language syntax and support for shared memory, superposition, and dynamic process creation, has been completed recently. The language parser for the second prototype is written in C (using yacc [23] and produces a Scheme [46] file that is provided as input to the new Spectrum simulator, written in Scheme. In order to make some of the simulator s utility functions available to the Spectrum compiler, we have translated those utilities into C with a Scheme to C compiler [7] Currently, configurations are specified ....

Gerald Jay Sussman and Jr. Guy Lewis Steele. Scheme: an interpreter for extended lambda calculus. Technical Report Memo 349, MIT Artificial Intelligence Laboratory, December 1975.

.... 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 the value of ....

Gerald Jay Sussman and Jr. Guy Lewis Steele. Scheme: An interpreter for extended lambda calculus. Technical Report Memo No. 349, MIT AI Laboratory, December 1975.

....we will not investigate in this paper. To implement preemptive concurrency at Icslas level, a scheduler must be provided that periodically switches from thread to thread. Since we adopted an interpreter technology, this amounts to implement a non preemptive scheduler within the interpreter, as in [SS75, Wan80] To be able to suspend threads, the interpreter maintains reified continuations as done in SML NJ [App92] but will use the GC technique of [Mat92] Continuations are reified into linked lists of control frames, this not only facilitates the design of the scheduler but also allows to ....

....or indirect) subgroups. The running status of a group is the content of the (cached) box provided (this cached value is valid and) no mutation was perceived on the running status of any of its supergroups. 5 Related Work Concurrency was already present in the first implementation of Scheme [SS75] ever since multiple implementations where studied and among them [KHM89, Hal89, GGS89, JP92] They all offer exchange instructions, breed equivalent and some of them made steps towards the group concept. We differ from these on three points: threads are not first class, computations are ....

[Article contains additional citation context not shown here]

Gerald Jay Sussman and Guy Lewis Steele Jr. Scheme: an interpreter for extended lambda calculus. MIT AI Memo 349, Massachusetts Institute of Technology, Cambridge, Mass., December 1975.

.... 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 takes the ....

Gerald Jay Sussman and Guy Lewis Steele Jr. Scheme: An interpreter for extended lambda calculus. Technical Report Memo No. 349, MIT AI Laboratory, December 1975.

....some usage of the explict control techniques of recording and reasoning about actions and goals in a blackboard data base. One important 4 The necessity of integrating (compiling) general purpose knowledge into special purpose procedures has been argued by Minsky [1965] Winograd [1972] Sussman [1975], and Hewitt [1975] who terms this the procedural embedding of knowledge . 5 McDermott [1977a,c] Rychener [1976] and Doyle [tbp] discuss the development of problem solving vocabularies with specific examples. 6 What makes procedures different from statements of fact Usually it is some ....

....LISP 1. 5 [McCarthy, et al. 1965] 10 For example, one can write interpreters for a recursive language like SCHEME using the full recursive power of the language (such as those described in [Steele and Sussman 1978b] or which only use a restricted form of the language (such as that presented in [Sussman and Steele 1975]) Given a logical language for interpretation, the detail of the self model can include descriptions like plan histories, purposes and dependencies, and transformation rules between syntactic constructions. The latter might range from simplification rules like (CAR (CONS A B) A to recursion ....

[Article contains additional citation context not shown here]

Gerald Jay Sussman and Guy Lewis Steele Jr., "SCHEME: An Interpreter for Extended Lambda Calculus," MIT AI Lab Memo 349, December 1975.

....multi shot continuations. 1 Introduction Scheme [5] and some implementations of ML [17] provide continuations as first class data objects. Continuations can be used to implement, at the source level, a number of interesting control features, such as loops, nonlocal exits, nonblind backtracking [22], nondeterministic computations [10, 14] and coroutines [7] Source level implementations of thread systems [9, 15, 21] especially in the area of graphical user interfaces (GUIs) 12, 13, 20, 23] are an important and rapidly growing application area for first class continuations. Continuations ....

....procedure passed to call cc or call 1cc, or explicitly, by invoking the continuation procedure obtained from the call cc or call 1cc. One shot continuations can be used in most contexts where multi shot continuations are currently used, e.g. to implement non local exits, non blind backtracking [22], and coroutines [7] One shot continuations can also be used to implement thread systems in user code. One shot continuations cannot be used to implement nondeterminism, as in Prolog [6] in which a continuation is invoked multiple times to yield additional values [10, 14] In these sorts of ....

Gerald J. Sussman and Guy L. Steele Jr. Scheme: An interpreter for extended lambda calculus. AI Memo 349, Massachusetts Institute of Technology Artificial Intelligence Lab, 1975.

....already passed out of the call to call cc, the continuation may still be invoked, but the result is to restart the computation at a point from which the system has already returned. This feature may be used to implement many interesting control structures, including loops, nonblind backtracking [16], coroutines [8] and engines [10, 7] The continuation of a procedure call is nothing more than the control stack of procedure activation records. If continuations were used only for nonlocal exits, as in Common Lisp [15] then the essence of a continuation object would be a pointer into the ....

Gerald J. Sussman and Guy L. Steele Jr., "Scheme: an Interpreter for Extended Lambda Calculus," Massachusetts Institute of Technology Artificial Intelligence Memo 349, 1975.

.... 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 the value of ....

Gerald Jay Sussman and Jr. Guy Lewis Steele. Scheme: An interpreter for extended lambda calculus. Technical Report Memo No. 349, MIT AI Laboratory, December 1975.

....this solution within a Lisp 1 (unified function=value cell Lisp) and later show how it naturally extends to Lisp 2 . 4. 1 Multiple Variable Scoping Regimes The experience of Common Lisp and PC Scheme have shown the utility of having both lexical and dynamic variable binding in Lisp like languages [16, 14]. However, both scoping regimes must enjoy equal status for both binding and reference. For example, consider the Common Lisp fragment (derived from the example in aspect IV but with the order of lexical and dynamic binding inverted. let ( x lexical value) lexical binding . let ( x ....

....car) lambda (model) list ford model) dynamic function car) car T) In the above example, the dynamic flet does not impede the compilation of the call to the primitive car. Nor does it have any effect on calls compiled in the dynamic scope of the binding. 5 Related Work In [14] and [16], lexical variable binding and unified function value cell are introduced for Lisp like languages. This was in part an effort to incorporate desirable aspects from other programming languages into Lisp. T [13] continued this tradition with the introduction of immutable binding, global reference ....

Gerald J. Sussman, Guy L. Steele, Jr., Scheme: An Interpreter for Extended Lambda Calculus, AI Memo 349, MIT AI Lab, Decembre 1975.

.... 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 takes the value ....

Gerald Jay Sussman and Guy Lewis Steele Jr. Scheme: An interpreter for extended lambda calculus. Technical Report Memo No. 349, MIT AI Laboratory, December 1975.

....of Common Lisp s generic arithmetic. More recently, Scheme became the first programming language to support hygienic macros, which permit the syntax of a block structured language to be extended in a consistent and reliable manner. Background The first description of Scheme was written in 1975 [28]. A revised report [25] appeared in 1978, which described the evolution of the language as its MIT implementation was upgraded to support an innovative compiler [26] Three distinct projects began in 1981 and 1982 to use variants of Scheme for courses at MIT, Yale, and Indiana University [21, 17, ....

Gerald Jay Sussman and Guy Lewis Steele Jr. Scheme: an interpreter for extended lambda calculus. MIT Artificial Intelligence Memo 349, December 1975.

....of Common Lisp s generic arithmetic. More recently, Scheme became the first programming language to support hygienic macros, which permit the syntax of a block structured language to be extended in a consistent and reliable manner. Background The first description of Scheme was written in 1975 [28]. A revised report [25] appeared in 1978, which described the evolution of the language as its MIT implementation was upgraded to support an innovative compiler [26] Three distinct projects began in 1981 and 1982 to use variants of Scheme for courses at MIT, Yale, and Indiana University [21, 17, ....

Gerald Jay Sussman and Guy Lewis Steele Jr. Scheme: an interpreter for extended lambda calculus. MIT Artificial Intelligence Memo 349, December 1975.

....of Common Lisp s generic arithmetic. More recently, Scheme became the first programming language to support hygienic macros, which permit the syntax of a block structured language to be extended in a consistent and reliable manner. Background The first description of Scheme was written in 1975 [28]. A revised report [25] appeared in 1978, which described the evolution of the language as its MIT implementation was upgraded to support an innovative compiler [26] Three distinct projects began in 1981 and 1982 to use variants of Scheme for courses at MIT, Yale, and Indiana University [21, 17, ....

Gerald Jay Sussman and Guy Lewis Steele Jr. Scheme: an interpreter for extended lambda calculus. MIT Artificial Intelligence Memo 349, December 1975.

....the concept of exact and inexact numbers. With the appendix to this report Scheme becomes the first programming language to support hygienic macros, which permit the syntax of a block structured language to be extended reliably. Background The first description of Scheme was written in 1975 [91]. A revised report [85] appeared in 1978, which described the evolution of the language as its MIT implementation was upgraded to support an innovative compiler [80] Three distinct projects began in 1981 and 1982 to use variants of Scheme for courses at MIT, Yale, and Indiana University [66, 57, ....

Gerald Jay Sussman and Guy Lewis Steele Jr. Scheme: an interpreter for extended lambda calculus. MIT Artificial Intelligence Memo 349, December 1975.

No context found.

Gerald Jay Sussman and Guy Lewis Steele Jr. Scheme: an interpreter for extended lambda calculus. MIT Arti cial Intelligence Memo 349, MIT, December 1975.

No context found.

Gerald Jay Sussman and Guy Lewis Steele Jr. Scheme: an interpreter for extended lambda calculus. MIT Arti cial Intelligence Memo 349, MIT, December 1975.

No context found.

Gerald Jay Sussman and Guy Lewis Steele Jr. Scheme: an interpreter for extended lambda calculus. MIT Arti cial Intelligence Memo 349, MIT, December 1975.

No context found.

Gerald J. Sussman, Guy L. Steele, Jr., Scheme: an Interpreter for extended lambda Calculus, MIT AI Memo 349, December 1975.

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