Moon, D. MacLISP Reference Manual, Revision 0. MIT Project MAC, 1974.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....represent environments explicitly by lists of bindings (called a lists) Whenever the value of a variable is needed, the current a list is searched. Each closure points to its environment a list, and storage occupied by inaccessible environments is recovered by the garbage collector. MACLISP [22] compromises the semantics of functional arguments in order to achieve greater e#ciency by using the shallow access model discussed by Moses [25] Bindings are stack based and are discarded when evaluation of the form creating them is complete. Environments are represented by pointers into the ....

....translate the resulting expression into an equivalent safe form. In this section, we describe in greater detail the relationship between LISP and lambda calculus schemata. Before proceeding, we need to clarify what we mean by LISP . Pure LISP, and various dialects such as LISP 1. 5 [21] MACLISP [22], and Common LISP [34] all share a common core, but there are significant di#erences with respect to crucial issues of variable binding strategy and evaluation rules. For example, if F is a variable bound to a function, MACLISP allows the application (F 3) whereas Common LISP requires one to ....

Moon, David A. MACLISP Reference Manual, revision 0. Project MAC---M.I.T., Cambridge, Massachusetts (April 1974).

....to post on servers or to redistribute to lists, requires prior specific permission and or a fee. ICFP 02, October 4 6, 2002, Pittsburgh, Pennsylvania, USA. Copyright 2002 ACM 1 58113 487 8 02 0010 . 5. 00 pattern matching transformations, but may perform arbitrary computation during expansion [12, 17, 3, 24, 26, 1]. In addition, macros may manipulate abstract syntax enriched with lexical information instead of manipulating raw source text [15, 2, 4, 8] which means that macro defined constructs can be assigned a meaning independent of details of the macro s expansion (e.g. whether the macro introduces a ....

D. A. Moon. MACLISP Reference Manual. MIT Press, 1974.

....USI ITS INSTITUTI : OF TECI lNOI.OGY ARTIFICIAI. IN I] I.I.IGENCE I.ABORATORY A.I. Memo No. 680a February 1983 Lets A.n Expressional Loop Notation by l ,ichard C. Waters ABSTRACT Many loops can be more easily understood and manipulated if they are viewed as being built up out of operations on sequences of values. A notation is introduced which makes this viewpoint explicit. Using it, loops can be ....

....Institute of Technoh)gy. Support for the laboratory s artificial intelligence research has been provided in part by the Advanced Research Projects Agency of the l)epartmcnt of Defense under Office of Naval Research contract N00014 80 C 0505, and in part by National Science Foundation grant MCS 7912179. lhe views and conclusions contained in this paper are those of the author, and should not be interpreted as necessarily representing the official policies, either expressed or implied, of the Department of Defense, or the United States Government. Waters 1 1. etS Introduction This ....

[Article contains additional citation context not shown here]

I).A. Moon, "MacLisp Reference Manual", MIT Cambridge MA, April 1974.

....environment to the place where that variable is bound, this time can be quite large for the tall environment trees actually encountered. For example, accessing a global variable from the bottom of a deep recursion requires time proportional to the depth of the recursion. The Maclisp interpreter [7] solves this problem through a scheme called shallow binding . In this scheme, each variable has a value cell, which can be accessed in constant time, and the bindings associated with the current environment are kept in these value cells so that they can be accessed without any search. Whenever a ....

Moon, D. MACLISP Reference Manual, Revision 0. Proj. MAC, M.I.T., Cambridge, Mass., 1974.

....in the hierarchy of regions, and in the descriptions of orientation frames and boundaries. Chapters 3, 4, and 5) The TOUR model, as described in this thesis, has been completely implemented. All the detailed examples presented below have been implemented in a program which is written in MACLISP [Moon 1974], and runs in about 100K words on the PDP 10 at the MIT Artificial Intelligence Laboratory. Appendix C discusses the main implementation technique behind the knowledge representations. An important computational characteristic of the TOUR machine is that it never performs an unbounded search of ....

Moon, D. A. 1974. Maclisp Reference Manual. Cambridge: MIT Project MAC.

....pointer and the storage block would automatically be reclaimed by the tireless garbage collector. The programmer no longer had to worry about prematurely freeing a block of storage which was still in use by another part of the system. The first problem was solved with the advent of good compilers [27,32] and new languages such as SIMULA especially designed for efficient compilation [1,5,14] The second was also solved to some extent by those same compilers because the user programs could be removed from the list storage area and freed from its inefficient constraints on representation. 1 Other ....

.... Actually create the cell. T[0] x; T[1] y; Install car and cdr. T Return address of new cell. end; The preceding code exhibits these changes. The complexity involved in this conversion is essentially that necessary to make the serial real time method work for several different spaces [27]. In such a system, each space is a contiguous area in the address space disjoint from the other spaces, and has its own representation conventions and allocation (and deallocation) strategies. The system of this section thus has two spaces, the heap and the user stack, which must be managed by ....

Moon, D.A. MACLISP Reference Manual. Project MAC, M.I.T., Cambridge, Mass., December 1975.

....as a Lisp hacker in July 1972 by the MIT Mathlab group, which was headed by Joel Moses. Steele soon took responsibility for maintaining the MacLisp interpreter and runtime system, allowing Jon L to concentrate almost full time on compiler improvements. The resulting new MacLisp compiler, NCOMPLR [Moon, 1974; Lisp Archive; Pitman, 1983] became a standard against which all other Lisp compilers were measured in terms of the speed of running code. Inspired by the needs of the MIT Artificial Intelligence Laboratory, whose needs covered the numeric computations done in vision and robotics, several new ....

....up integer bignum division [Knuth, 1981, ex. 4.5.2 34] In 1973 and 1974, David Moon led an effort to implement MacLisp on the Honeywell 6180 under Multics. As a part of this project he wrote the first truly comprehensive reference manual for Maclisp, which became familiarly known as the Moonual [Moon, 1974]. Richard Greenblatt started the MIT Lisp Machine project in 1974 [Greenblatt, 1974] David Moon, Richard Stallman, and many other MIT AI Lab Lisp hackers eventually joined this project. As this project progressed, language features were selectively retrofitted into PDP 10 MacLisp as the two ....

Moon, David A. MacLISP Reference Manual. MIT Project MAC, Cambridge, Massachusetts, April 1974.

....functional language extended with constructs for dynamic binding. 1 Introduction Dynamic binding has traditionally been associated with Lisp dialects. It appeared in McCarthy s Lisp 1. 0 [24] as a bug and became a feature in all succeeding implementations, like for instance MacLisp 2 [28], Gnu Emacs Lisp [23] Even modern dialects of the language which favour lexical scoping provide some form of dynamic variables, with special declarations in Common Lisp [43] or even simulate dynamic binding by lexically scoped variables as in MITScheme s fluid let [18] Lexical scope has now ....

....Delimiters Even though Standard ML [26] is a lexically scoped language, raised exceptions are caught by the latest active handler. Usually, programmers install exception handlers for the duration of an expression, i.e. the handler is dynamically bound during the extent of the expression. MacLisp [28] and Common Lisp [43] catch and throw, Eulisp let cc [34] are other examples of exception like control operators with a dynamic extent. More generally, control delimiters are used to create partial continuations, whose different semantics tolerate various degrees of dynamicness [5, 20, 31, 38, ....

David A. Moon. Maclisp reference manual. Technical report, MIT Project Mac, April 1974.

No context found.

Moon, D. MacLISP Reference Manual, Revision 0. MIT Project MAC, 1974.

No context found.

Moon, D. MacLisp Reference Manual. MIT Lab. for Computer Science. Cambridge, Mass., 1980.

No context found.

David A. Moon. MACLisp reference manual. Project MAC, MIT, Cambridge, MA, April 1974.

No context found.

MOON, D. A. 1974. MACLISP reference manual. MIT AI Lab., Cambridge, Mass.

No context found.

Moon, David A. MACLISP Reference Manual , Project MAC, Mass. Institute of Tech. (April 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