CAR and CDR
In computer programming, CAR (
car) // (listen) and CDR (
cdr) (// (listen) or // (listen)) are primitive operations on cons cells (or "non-atomic S-expressions") introduced in the Lisp programming language. A cons cell is composed of two pointers; the car operation extracts the first pointer, and the cdr operation extracts the second.
Thus, the expression
(car (cons x y)) evaluates to
(cdr (cons x y)) evaluates to
When cons cells are used to implement singly linked lists (rather than trees and other more complicated structures), the car operation returns the first element of the list, while cdr returns the rest of the list. For this reason, the operations are sometimes given the names first and rest or head and tail.
Lisp was originally implemented on the IBM 704 computer, in the late 1950s.
The popular explanation that CAR and CDR stand for "Contents of the Address Register" and "Contents of the Decrement Register" does not quite match the IBM 704 architecture; the IBM 704 does not have a programmer-accessible address register and the three address modification registers are called "index registers" by IBM.
The 704 and its successors have a 36-bit word length and a 15-bit address space. These computers had two instruction formats, one of which, the Type A, had a short, 3-bit, operation code prefix and two 15-bit fields separated by a 3-bit tag. The first 15-bit field was the operand address and the second held a decrement or count. The tag specified one of three index registers. Indexing was a subtractive process on the 704, hence the value to be loaded into an index register was called a "decrement".:p. 8 The 704 hardware had special instructions for accessing the address and decrement fields in a word.:p. 26 As a result it was efficient to use those two fields to store within a single word the two pointers needed for a list.:Intro.
car("contents of the address part of register number"),
cdr("contents of the decrement part of register number"),
cpr("contents of the prefix part of register number"), and
ctr("contents of the tag part of register number"),
each of which took a machine address as an argument, loaded the corresponding word from memory, and extracted the appropriate bits.
LXD JLOC 4 # C( Decrement of JLOC ) → C( C ) # Loads the Decrement of location JLOC into Index Register C CLA 0,4 # C( 0 - C( C ) ) → C( AC ) # The AC register receives the start address of the list PAX 0,4 # C( Address of AC ) → C( C ) # Loads the Address of AC into Index Register C PXD 0,4 # C( C ) → C( Decrement of AC ) # Clears AC and loads Index Register C into the Decrement of AC
LXD JLOC 4 # C( Decrement of JLOC ) → C( C ) # Loads the Decrement of location JLOC into Index Register C CLA 0,4 # C( 0 - C( C ) ) → C( AC ) # The AC register receives the start address of the list PDX 0,4 # C( Decrement of AC ) → C( C ) # Loads the Decrement of AC into Index Register C PXD 0,4 # C( C ) → C( Decrement of AC ) # Clears AC and loads Index Register C into the Decrement of AC
A machine word could be reassembled by cons, which took four arguments (a,d,p,t).
The prefix and tag parts were dropped in the early stages of Lisp's design, leaving CAR, CDR, and a two-argument CONS.
cdr can be given short and more or less pronounceable names of the same form. In Lisp,
(cadr '(1 2 3)) is the equivalent of
(car (cdr '(1 2 3))); its value is
(caar '((1 2) (3 4))) is the same as
(car (car '((1 2) (3 4)))); its value is
1. Most Lisps, for example Common Lisp and Scheme, systematically define all variations of two to four compositions of
Other computer languages
Many languages (particularly functional languages and languages influenced by the functional paradigm) use a singly linked list as a basic data structure, and provide primitives or functions similar to
cdr. These are named variously
tail, etc. In Lisp, however, the cons cell is not used only to build linked lists but also to build pair and nested pair structures, i.e. the
cdr of a cons cell need not be a list. In this case, most other languages provide different primitives as they typically distinguish pair structures from list structures either typefully or semantically. Particularly in typed languages, lists, pairs, and trees will all have different accessor functions with different type signatures: in Haskell, for example,
snd when dealing with a pair type. Exact analogues of
cdr are thus rare in other languages.
- See, for example, Mitchell, John C. (2003), Concepts in Programming Languages, Cambridge University Press, pp. 28–29, ISBN 9781139433488, Section 3.4, Innovations in the Design of Lisp. The reference identifies the IBM 704 and correctly explains the address and decrement part of a cons cell, but then it omits the "part of" in McCarthy's explanation.
- 704 - electronic data-processing machine http://bitsavers.informatik.uni-stuttgart.de/pdf/ibm/704/24-6661-2_704_Manual_1955.pdf
- McCarthy, John (1979-02-12). "History of Lisp".
- McCarthy (1960, pp. 26–27) discusses registers on the free list and in garbage collection.
- McCarthy, John; Abrahams, Paul W.; Edwards, Daniel J.; Hart, Timothy P.; Levin, Michael I. (1985), LISP 1.5 Programmer's Manual (second ed.), Cambridge, Massachusetts: MIT Press, ISBN 978-0-262-13011-0, page 36, describes cons cells as words with 15-bit "address" and "decrement" fields.
- A Fortran-Compiled List-Processing Language
- A Fortran-Compiled List-Processing Language; HTML transcription
- Portions from NILS' LISP PAGES- http://t3x.dyndns.org/LISP/QA/carcdr.html
- MIT AI Lab Memo 6 ftp://publications.ai.mit.edu/ai-publications/pdf/AIM-006.pdf
- CODING for the MIT-IBM 704 COMPUTER ftp://bitsavers.informatik.uni-stuttgart.de/pdf/mit/computer_center/Coding_for_the_MIT-IBM_704_Computer_Oct57.pdf
- Russell, Steve. "Writing and Debugging Programs" (PDF). RLE and MIT Computation Center. CSAIL Publications and Digital Archive (Memo). AI Memo, no. 6. Cambridge , Massachusetts: MIT Artificial Intelligence Laboratory. OCLC 35415961. Retrieved July 20, 2017.
- Faase, Frans (2006-01-10). "The origin of CAR and CDR in LISP".
- Graham, Paul (1996). ANSI Common Lisp. Prentice Hall. ISBN 978-0-13-370875-2.
- Barski, Conrad (2010). Land of Lisp : learn to program in Lisp, one game at a time!. San Francisco, CA: No Starch Press, Inc. ISBN 978-1-59327-281-4.