This revised, second edition three-volume set uses the Log programming language as the vehicle for an exploration of computer science from the perspective of symbolic computation and artificial intelligence.

 

This book is aimed at the following children: secondary school , university .

There are 1068 pages in this book. This book was published 1998 by MIT Press Ltd .

This book has the following chapters: Part 1 Data files: reader and writer; end of file; case sensitivity; dribble files; a text formatter; page geometry; the program; improving the formatter. Part 2 Example - finding file differences: program overview; the file information block abstract data type; saving and re-reading input lines; skipping equal lines; comparing and remembering unequal lines; reporting a difference; program listing. Part 3 Nonlocal exit: quiz program revisited; nonlocal exit and modularity; nonlocal output; catching errors; ending it all. Part 4 Example - solitaire: the user interface; the game of solitaire; running the program; program structure; initialization; data abstraction; stacks; program as data; multiple branching; further explorations; program listing. Part 5 Program as data: text and define; automated definition; a single-keystroke program generator; procedure cross-reference listing. Part 6 Example - BASIC compiler: a short course in BASIC; using the BASIC translator; overview of the implementation; the reader; the parser; the code generator; the runtime library; further explorations; program listing. Part 7 Pattern matcher: reinventing Equal for lists; a simple pattern matcher; efficiency and elegance; Logo's evaluations of inputs; indirect assignments; defaults; program as data; parsing rules; further explorations; program listing. Part 8 Property lists: naming properties; writing property list procedures in Logo; property lists aren't variables; how language designers earn their pay; fast replacement; defaults; an example - family trees. Part 9 Example - doctor: Eliza and artificial intelligence; Eliza's linguistic strategy; stimulus-response psychology; property lists; generated symbols; modification of list structure; linguistic structure; further explorations; program listing. Part 10 Iteration, control structures, extensibility: recursion as iteration; numeric iteration; Logo - an extensible language; no perfect control structures; iteration over a list; implementing apply; mapping; mapping as a metaphor; other higher order functions; mapping over trees; iteration and tail recursion; multiple inputs to For; the evaluation environment bug. Part 11 Example - cryptographer's helper: program structure; guided tour of global variables; what's in a name? flag variables; iteration over letters; computed variables names; further explorations; program listing. (Part contents).