A Model and Stack Implementation of Multiple Environments

Communications of the ACM

Volumn 16, Issue 10, 1973, Pages 591-603

  Bobrow, Daniel G ^a   Wegbreit, Ben ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

access environments; backtracking; control structures; coroutines; dendrarchy; dynamic storage allocation; environments; extensible control structures; FUNARG problem; functional arguments; label valued variables; multiprocessor systems; multitasking; retention; stack allocation

Indexed keywords

DENDRARCHY; FUNARG PROBLEM; LABEL-VALUED VARIABLES;

COMPUTER PROGRAMMING;

EID: 0015672155     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/362375.362379     Document Type: Article

References (29)

1. Bobrow, D.G. Storage management in Lisp. In Symbol Manipulation Languages and Techniques, Bobrow (Ed.), North-Holland Pub. Co., Amsterdam, 1968.
2. Bobrow, D.G. Requirements for advanced programming systems for list processing. Comm. ACM 15, 7 (July 1972), 618-627.
3. Burge, W.H. Some examples of the use of function producing functions. Proc. SYMSAM II, 1971.
4. Dijkstra, E.W. Co-operating sequential processes. In Programming Languages, Genuys (Ed.), Academic Press, New York, 1967.
5. Dijkstra, E.W. Recursive programming. Num. Math. 2 (1960), 312-318.
6. Programming Systems and Languages, S. Rosen (Ed.), McGraw-Hill, New York, 1967.
7. Fenichel, R. On implementation of label variables. Comm. ACM 14, 5 (May 1971), 349-350.
8. Fenichel, R. and Yochelson, J. A lisp garbage collector for virtual-memory computer systems. Comm. ACM 12, 11 (Nov. 1969), 611-612.
9. Floyd, R.W. Non-deterministic algorithms. J. ACM 14, 4 (Oct. 1967), 636-644.
10. Golomb, S.W., and Baumert, L.D. Backtrack programming. J. ACM 12, 4 (Oct. 1965), 516-524.
11. Hewitt, C. PLANNER: A language for manipulating models and proving theorems in a robot. Proc. Internat. Joint Conf. on Artif. Intell. Washington, D.C., May 1969.
12. IBM System/360, PL/I Language Reference Manual, Form C28-8201-2, IBM (1969).
13. Johnston, J.B. The contour model of block structured processes. in Tou and Wegner [23], pp. 55-82.
14. Knuth, D.E. The Art of Computer Programming, Vol. I, Addison-Wesley. Reading, Mass., 1969.
15. McCarthy, J., et al. Lisp 1.5 Programmer's Manual. The M.I.T. Press, Cambridge, Mass., 1962.
16. Minsky, M. A Lisp garbage collector using serial secondary storage. M.I.T. Proj. MAC, Memo. MAC-M-129, Dec. 1963.
17. Moses, J. The function of FUNCTION in LISP. SIGSAM Bull. (July 1970), 13-27.
18. Prenner, C., Spitzen, J., and Wegbriet, B. An implementation of backtracking for programming languages. Proc. 27th Nat. Conf. ACM 1972, pp. 763-771.
19. Prenner, C. Multi-path control structures for programming languages. Ph.D. Th., Harvard U., Cambridge, Mass. May 1972.
20. Quam, L. Lisp 1.6 Ref Manual. Stanford AI Lab.
21. Reynolds, J. GEDANKEN—A simple typeless language based on the principle of completeness and the reference concept. Comm. ACM 13, 5 (May 1970), 308-319.
22. Sussman, G.J., and McDermott, D. Why conniving is better than planning. Proc. AFIPS 1972 FJCC, Vol. 41, Part 2, AFIPS Press, Montvale, N.J., pp. 1171-1179.
23. Thomas, R.H. A model for process representation and synthesis. Ph.D. Th., Proj. MAC Rept. TR-87, M.I.T. Cambridge, Mass., 1971.
24. Tou, J., and Wegner, P. (Eds.) Sigplan Notices—Proc. Symp. on Data Structures in Prog. Lang., 6, 2 (Feb. 1971).
25. van Wijngaarden, A. (Ed.) Report on the Algorithm Language Algol 68, MR 101, Mathematisch Centrum, Amsterdam (Feb. 1969).
26. Wegbreit, B. Studies in extensible programming languages. Ph.D. Th., Harvard U., Cambridge, Mass. May 1970.
27. Wegbreit, B. The ECL programming system. Proc. AFIPS 1971 FJCC, Vol. 39, AFIPS Press, Montvale, N.J., pp. 253-262.
28. Wegner, P. Data structure models for programming languages, in Tou and Wegner [23], pp. 55-82.
29. Weizenbaum, J. The funarg problem explained. M.I.T., Cambridge, Mass., Mar. 1968.