Kent M. Pitman, The revised MacLisp Manual (Saturday evening edition), MIT Laboratory for Computer Science Technical Report 295, May 21, 1983. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Decomposing lambda - the Kernel programming language - Shutt (2003) (Correct)
....support one argument fexprs , whose one parameter was bound to the entire list of operands, but the name of the one parameter could be captured if it occurred in an operand; so MacLisp also supported two argument fexprs , whose second parameter was bound to the unextended dynamic environment. [Pi83] elegance: It requires two compound call mechanisms, one in each of the two phases of evaluation, and the call mechanisms are inherently distinct from each other by the very fact that they are in explicitly separate phases of evaluation. The fexpr strategy, however, does not require explicitly ....
Kent M. Pitman, The revised MacLisp Manual (Saturday evening edition), MIT Laboratory for Computer Science Technical Report 295, May 21, 1983.
Decomposing lambda - the Kernel programming language - Shutt (2003) (Correct)
....support one argument FEXPRs , whose one parameter was bound to the entire list of operands, but the name of the one parameter could be captured if it occurred in an operarid; so MacLisp also supported two argument FEXPRs , whose second parameter was bound to the unextended dynamic environment. [Pi83] elegance: It requires two compound call mechanisms, one in each of the two phases of evaluation, and the call mechanisms are inherently distinct from each other by the very fact that they are in explicitly separate phases of evaluation. The fexpr strategy, however, does not require explicitly ....
Kent M. Pitman, The revised MacLisp Manual (Saturday evening edition), MIT Laboratory for Computer Science Technical Report 295, May 21, 1983.
Revised^5 Report on the Algorithmic Language Scheme - Kelsey, (ed.), Clinger.. (1998) Self-citation (Pitman) (Correct)
....#t (equal (lambda (x) x) lambda (y) y) # unspecified 6.2. Numbers Numerical computation has traditionally been neglected by the Lisp community. Until Common Lisp there was no carefully thought out strategy for organizing numerical computation, and with the exception of the MacLisp system [20] little effort was made to execute numerical code efficiently. This report recognizes the excellent work of the Common Lisp committee and accepts many of their recommendations. In some ways this report simplifies and generalizes their proposals in a manner consistent with the purposes of Scheme. ....
Kent M. Pitman. The revised MacLisp manual (Saturday evening edition). MIT Laboratory for Computer Science Technical Report 295, May 1983.
Revised^5 Report on the Algorithmic Language Scheme - Kelsey, (ed.), Clinger.. (1998) (112 citations) Self-citation (Pitman) (Correct)
....#t (equal (lambda (x) x) lambda (y) y) # unspecified 6.2. Numbers Numerical computation has traditionally been neglected by the Lisp community. Until Common Lisp there was no carefully thought out strategy for organizing numerical computation, and with the exception of the MacLisp system [20] little e#ort was made to execute numerical code e#ciently. This report recognizes the excellent work of the Common Lisp committee and accepts many of their recommendations. In some ways this report simplifies and generalizes their proposals in a manner consistent with the purposes of Scheme. It ....
Kent M. Pitman. The revised MacLisp manual (Saturday evening edition). MIT Laboratory for Computer Science Technical Report 295, May 1983.
Revised^5 Report on the Algorithmic Language Scheme - Kelsey, (ed), Clinger.. (1998) Self-citation (Pitman) (Correct)
....= #t (equal (lambda (x) x) lambda (y) y) unspecified 6.2. Numbers Numerical computation has traditionally been neglected by the Lisp community. Until Common Lisp there was no carefully thought out strategy for organizing numerical computation, and with the exception of the MacLisp system [20] little effort was made to execute numerical code efficiently. This report recognizes the excellent work of the Common Lisp committee and accepts many of their recommendations. In some ways this report simplifies and generalizes their proposals in a manner consistent with the purposes of Scheme. ....
Kent M. Pitman. The revised MacLisp manual (Saturday evening edition). MIT Laboratory for Computer Science Technical Report 295, May 1983.
Revised^4 Report on the Algorithmic Language Scheme - Clinger, (ed.), Rees.. (1991) (242 citations) Self-citation (Pitman) (Correct)
....(symbol string (string symbol K. Harper, M.D. #t 6.5. Numbers Numerical computation has traditionally been neglected by the Lisp community. Until Common Lisp there was no carefully thought out strategy for organizing numerical computation, and with the exception of the MacLisp system [62] little effort was made to execute numerical code efficiently. This report recognizes the excellent work of the Common Lisp committee and accepts many of their recommendations. In some ways this report simplifies and generalizes their proposals in a manner consistent with the purposes of Scheme. ....
Kent M. Pitman. The revised MacLisp manual (Saturday evening edition). MIT Laboratory for Computer Science Technical Report 295, May 1983.
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