English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

1 answers

Too long ago I forgot details other than it is somewhat handy for list processing (for Pete's sake that's its full name)

Scheme variant nor original LISP has no equivlent of printf(). The output of the interpreter program is that of the LISP function itself, the return of the function..

LISP has two types of variables: arrays/lists, singles/atoms

Recursion rules, after done with LISP, you would rival among the top mathematicians in recursions since it has no loops.

2007-09-19 00:55:35 · answer #1 · answered by Andy T 7 · 0 0

fedest.com, questions and answers