Research · April 1960

Placed by the contemporary primary publication. The exact event date is not known; its documented interval appears below.

Lisp

McCarthy described a language in which program and data share one list form, and computation is defined by recursive functions over symbols.

Why it matters

Symbolic computation got a working tool, and nearly every AI system of the next thirty years was written in it.

The paper introduced eval as a mathematical definition of the language; Steve Russell noticed eval could be implemented and did so on the IBM 704. Garbage collection, closures and the sameness of code and data entered common use from here. STUDENT, DENDRAL and SHRDLU were all written in Lisp.

Event record

Event date

1958 – April 1960

Timeline date

Primary publication date

Verification

Sources gathered automatically · September 17, 2026

Lines

ID

evt-0090

Work on the language began in 1958; the paper appeared in CACM in April 1960. The anchor is the publication.

Sources

primary Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I
Communications of the ACM · Published April 1960

Related events

Related Programs with Common Sense
The language gave a way to write the symbolic expressions an advice taker needs.

Records that link to this one

Builds on SAINT
The program was written in Lisp.
A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus
Builds on STUDENT
The program was written in Lisp.
Natural Language Input for a Computer Problem Solving System
Builds on SHRDLU
The program is written in Lisp, with Micro-Planner built on top of it.
Procedures as a Representation for Data in a Computer Program for Understanding Natural Language
Builds on MYCIN
The system is written in Lisp.
Computer-Based Medical Consultations: MYCIN
Related The Connection Machine
The machine was built for parallel data processing rather than sequential execution of symbolic code.
Builds on LCF: a program that checks proofs about computation
According to Gordon's retrospective, Edinburgh LCF, including the ML interpreter, was implemented in Lisp.
From LCF to HOL: a short history (Mike Gordon)
Builds on Boyer and Moore: induction without human hints
The program proves theorems about recursive LISP functions and runs them in a LISP interpreter to build its induction formula.
Proving Theorems about LISP Functions (Robert S. Boyer, J Strother Moore), Advance Papers of the Third International Joint Conference on Artificial Intelligence, 486-493