Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I.

McCarthy, J. (1960). Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I. Communications of the ACM, 3(4), 184-195.

Type

Journal article

Intellectual base

Primary research

Year

1960

DOI

10.1145/367177.367199

Link

https://doi.org/10.1145/367177.367199

Cited from

computer_science, linguistics_semiotics

Cited by

3 citations across 3 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Garbage Collection
  • The declared root set is the precise structural commitment — the machine registers, the call stack, and the global variables, the stipulated entry points from which all legitimate access begins.

    This sourceIntroduces the mark-and-sweep garbage collector, with roots in registers, stack, and globals and a transitive mark of all reachable cells; tracing reclaims cycles reference counting cannot.

• Meta-Symbolic Reflection
  • ) enabled programs to manipulate programs; Lisp's homoiconicity (McCarthy 1960
• Recursion
  • The function-defined-in-terms-of-itself structure

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:d31779e054b6 · see in the full table