Alan Bawden, Rei cation without Evaluation, memo 946, MIT AI Lab, June 1988. Available (as of December 2002) at URL: http://www.ai.mit.edu/publications/pubsDB/pubs.html  Home/Search   Document Not in Database   Summary   Related Articles   Check

....end of x4.2.2 on use of quote in an alternative implementation of set . In principle, both forms of variable capturing are special cases of context capturing. We won t pursue that connection in this report, though. Exactly this example (modulo trivialities of Kernel syntax) was used in [Baw88] as a criticism of the behavior of rst class operatives in general quite accurately, since operand capturing is just exactly the form of context capturing enabled by language support for rst class operatives. Applicative call is apparently intended to take a function f and an arbitrary object ....

Alan Bawden, Rei cation without Evaluation, memo 946, MIT AI Lab, June 1988. Available (as of December 2002) at URL: http://www.ai.mit.edu/publications/pubsDB/pubs.html

....rst. It is worth noting that the counter example is a program. 4 Related Work While there are a large number of studies of LISP with which we share either our general methodology (e.g. Gor75, Car76, Mas86, MT89, FFKD86, Fel88] or our general subject matter (e.g. Pit80, MP80, Smi82] or [Smi84, dRS84, FW84, FW86, DM88, Baw88]) we are unfamiliar with any axiomatic treatments of LISP s metalinguistic power. The rst structured operational semantics for LISP was de ned for M expression LISP by Gordon [Gor75] This was used as the basis for an induction principle for proving properties of LISP programs. One application ....

....case, 3 LISP. Apart from the similarity of the general frameworks there are many di erences. 2 LISP is a descendant of McCarthy s original coding algorithm but with additional structure superimposed on it. As a result 2 LISP is rather complicated and none of the subsequent treatments of re ection [FW84, FW86, DM88, Baw88] adopted it. Comparing speci c aspects, our representation function R corresponds to Smith s reifying up operator and the inverse function R 1 corresponds to Smith s down operator. In 2 LISP down and up are user operators and down depends on the termination of its argument. Thus down is not the ....

[Article contains additional citation context not shown here]

A. Bawden. Reication without evaluation. In Proceedings of the ACM Symposium on LISP and Functional Programming, pages 342-351, 1988.

.... v , it is obviously not the case that reify [ 0 v is an extension (conservative or otherwise) of v . 23 5 Related Work While there are many studies of LISP with which we share either our general methodology [Gor75, BM75, Car76, Mas86, MT89, FFKD86, Fel88] or our general subject matter [Pit80, MP80, Smi82, Smi84, RS84, FW84, FW86, DM88, Baw88], we are unfamiliar with any attempts to axiomatize LISP s metalinguistic facilities. We are also unfamiliar with any reference in the literature to the problematic nature of equation (12) in McCarthy s original representation function. 5.1 Gordon The rst structured operational semantics for ....

....operators and down depends on the termination of its argument. Thus down is not the inverse of up. Our set of term representations corresponds roughly to Smith s handles. Extended M LISP corresponds to a restricted form of Smith s 3 LISP and the suite of re ective languages which followed [FW84, FW86, DM88, Baw88]. The restrictions relate to the fact that our eval is a function of one argument: a representation of a term. 3LISP, on the other hand, is developed in the context of an evaluator which determines the meaning of an expression relative to an environment and a continuation. 3 LISP rei ers have ....

Alan Bawden. Reication without evaluation. In Proceedings of the 1988 ACM Conference on LISP and Functional Programming, pages 342-351, 1988.

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