Language Comparisons 1. Language list 1.1. Easily extendible to compute new functions using function definition. New data types programmable, but usually by modifying the language system with new C-defined functions.
Basic language lacks arrays.
Emphasizes recursive definitions of computations. Fairly easy to write correct code in. Strongly typed, but only at run-time, so must execute revealing test case to uncover erroneous constructs. Built in scheme for backtrack search. Uses clear patterns for list processing primitives.