Symbolic Computing with Lisp |
Common terms and phrases
abstract data type algebraic expressions algorithm append apply-env args argument association list binding clause Common LISP cond conditional expression conjunction conjunctive normal form CONS cell constant construct corresponding data access functions data domain data objects data structure defined defun described disjunction domain dotted pairs EBNF element endp environment evaluated example expr extend-env fn-env formal parameter function call function definition given global GRAIL grammar identifier implementation induction inference input integer iteration lambda expression let expression lexical lexical analyzer logical formula mapcar mapped function metaprograms negation nonterminal numeric atoms operand otherwise output parsing Pascal pattern matching pattern target pattern variables pretty-printer procedure property list propositional calculus quantified recursive represented result returns rules S-expression S-Lisp Section segment variable selector sequence setf simplified sl-expr Small Lisp programs specified symbolic atom symbolic computing symbolic data syntax tail recursion theorem tion tokens translation type signatures
References to this book
Learning from Data: Artificial Intelligence and Statistics V Doug Fisher,Hans-J. Lenz Limited preview - 1996 |