Symbolic Computing with Lisp |
Contents
INTRODUCTION | 1 |
SMALL LISP | 8 |
RECURSIVE PROGRAMMING TECHNIQUES | 31 |
Copyright | |
11 other sections not shown
Common terms and phrases
abstract data type accum algebraic expressions algorithm append args argument clause Common LISP cond conditional expression conjunctive normal form CONS cell constant construct constructor corresponding data access functions data domain data objects data structures defined defun deriv described disjunction domain EBNF element endp environment evaluated example expr fn-env function call function definition given glist GRAIL grammar hlist identifier implementation induction input integer interpreter iteration lambda expression let expression lexical lexical analyzer list representation logical formula mapcar mapped function metaprograms negation node nonterminal notation system numeric atoms operand otherwise output parsing Pascal pattern variables pretty-printer procedure programming language property list propositional calculus represented rest list result returns S-expression S-Lisp Section selector sequence setf simplified sl-expr Small Lisp programs specified subtrees symbolic atoms symbolic computing applications symbolic data syntax tail recursive theorem tion tokens translation tree truth value type signatures
References to this book
Learning from Data: Artificial Intelligence and Statistics V Doug Fisher,Hans-J. Lenz Limited preview - 1996 |