Attention: For textbook, access codes and supplements are not guaranteed with used items.
Arrives in 3-7 Business Days
Schemes essential features, listed below, are surveyed in this book. Symbolic expressions are used to represent both code and data. Functionsor more generally, procedures are first-class values that can be stored in data structures and passed to and returned from other functions. Closures provide the convenience of lexical scoping. Tail recursive algorithms execute with the same efficiency as imperative loops. Continuations allow Scheme to be extended with user-defined, dynamic flow control mechanisms such as exception handling, co-routines, nondeterministic backtracking, and logic variables, to name a few. Schemes hygienic syntax extension mechanism puts user-defined syntax on an equal footing with its own syntax. These essential features make Scheme one of the most expressive, extensible, yet minimal computer languages in existence. The purpose of this book is to expedite the readers learning of Scheme or to serve as a quick reference.