LISP |
Contents
COMPILING AUGMENTED TRANSITION NETWORKS | 8 |
BASIC LISP FUNCTIONS | 13 |
Constructed out of Sexpressions LISP Handles Both Fixed and Floatin | 32 |
Copyright | |
21 other sections not shown
Other editions - View all
Common terms and phrases
A B C A-LIST ADD1 ANIMAL Answer APPEND APPLE argument array Artificial Intelligence atom augmented transition networks binary image CAAR CADAR CADDR CADR called CAR and CDR CAR CDR CAR QUEUE chapter clauses column compiler COND EQUAL COND NULL COND ZEROP CONS CAR CONS LIST COUNTATOMS Define definition DEFPROP DEFUN depth-first search DIFFERENCE element EQUAL CAR EVAL evaluated example fact FEXPR FGET FIBONACCI FINDSPACE FPUT FRAME free variable FUNCALL function name GENSYM GETRIDOF given GO LOOP GRASP GREATERP INF-TO-PRE INTERLISP LAST-PARSED LESSP LISP function list structure MACLISP MACRO MAPCAR MAPCAR LAMBDA MATCH memory cells MICRO-EVAL MOVEOBJECT node noun group OBJECT PLACE OPCODE OPERANDS OPERATOR parameter PARSE-NOUN-GROUP PARSE-WORD THIS-NODE predicate PRETTYPRINT PRINT Problems Problem PROG property list PUTAT PUTON PUTPROP QUOTIENT recursive REMAINING-WORDS result RETURN NIL roots RPLACD RULE s-expression SETQ QUEUE SLOT SQRT SUB1 SUBR SUBST tail recursive tree UNGRASP value returned zero