--, Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I, Communications Of the ACM, vol. 3, April, 1960, pp. 184-195. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Reflection in Oberon - Steindl (1997) (1 citation) (Correct)
....If a programming system supports questions of this kind we call it a metaprogramming system. If programs can ask these question also about themselves we call such a system reflective. The notions of metaprogramming and reflection are common and widely used in programming languages like Lisp ([McCar60], Smi82] and Smalltalk ( GR83] In Lisp all programs are treated as data. It is possible to inspect their structure and even to dynamically build new programs (higher order functions) that can be executed. In Smalltalk types are represented as classes and procedures as methods of these classes. ....
J. McCarthy: Recursive functions of symbolic expressions and their computation by a machine. Communications of the ACM 3 (4), 1960, 184-195.
Functional Programming and Embedded Systems - Wallace (1995) (2 citations) (Correct)
....list on top of the heap. In addition, many of these algorithms are designed to optimise virtual memory performance (the treadmill is a notable exception) an embedded system has no virtual memory, and often cannot afford the expense of much nonactive heap memory. In this respect, a mark sweep [McCarthy60] based collector is more attractive for an embedded system, since its overhead is a single bit per heap cell. A traditional stop and collect mark sweep algorithm is generally invoked when the freelist becomes empty. The marker recursively traces the graph reachable from the computational roots, ....
Recursive functions of symbolic expressions and their computation by machine., John McCarthy, Communications of the ACM 3(4), pp.184-195 (April 1960)
A Basis For A Mathematical Theory Of Computation - McCarthy (1963) (91 citations) (Correct)
No context found.
--, Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I, Communications Of the ACM, vol. 3, April, 1960, pp. 184-195.
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