| 
|
QuoteRef: mccaJ_1960
topics >
all references >
Topic:
data type as constructors, selectors, and predicates
Topic:
lists
ThesaHelp:
ACM references m-z
Topic:
list processing
Topic:
if-then-else test chain
ThesaHelp:
references m-o
Topic:
function application
Reference
McCarthy, J., "Recursive functions of symbolic expressions and their computation by machines", Communications of the ACM, 3, pp. 184-195, 1960. Google
Notes
about LISP
QuoteRef: mccaJ_1960 ;;184 conditional expressions (predicate -> exp, predicate -> exp etc) e.g., p or q is (p->q, T->F). QuoteRef: mccaJ_1960 ;;187 Lists made of ordered pairs (S expressions) must terminate with nil QuoteRef: mccaJ_1960 ;;187 Lisp has predicates (atom, eq-- true iff two equal atoms), selectors (carr -- 1st element, cdr -- last element of pair) and constructors (cons -- construct and ordered pair) QuoteRef: mccaJ_1960 ;;187 LABEL (function-name, lambda-expressing) and APPLY (function, arg list
Topic: data type as constructors, selectors, and predicates (20 items)
Topic: lists (7 items)
ThesaHelp: ACM references m-z (280 items)
Topic: list processing (15 items)
Topic: if-then-else test chain (18 items)
ThesaHelp: references m-o (268 items)
Topic: function application (18 items)