Advanced techniques
著者
書誌事項
Advanced techniques
（Computer science Logo style / Brian Harvey, v. 2）
MIT, c1997
2nd ed
大学図書館所蔵 件 / 全13件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and indexes
内容説明・目次
内容説明
This series is for people-adults and teenagers-who are interested in computer programming because it's fun. The three volumes use the Logo programming language as the vehicle for an exploration of computer science from the perspective of symbolic computation and artificial intelligence. Logo is a dialect of Lisp, a language used in the most advanced research projects in computer science, especially in artificial intelligence. Throughout the series, functional programming techniques (including higher order functions and recursion) are emphasized, but traditional sequential programming is also used when appropriate.
In the second edition, the first two volumes have been rearranged so that illustrative case studies appear with the techniques they demonstrate. Volume 1 includes a new chapter about higher order functions, and the recursion chapters have been reorganized for greater clarity. Volume 2 includes a new tutorial chapter about macros, an exclusive capability of Berkeley Logo, and two new projects. Throughout the series, the larger program examples have been rewritten for greater readability by more extensive use of data abstraction.
In Volume 3 "Beyond Programming", the reader learns that computer science includes not justprogramming computers, but also more formal ways to think about computing, such as automata theory and discrete mathematics. In contrast to most books on those subjects, this volume presents the ideas in the form of concrete, usable computer programs rather than as abstract proofs. Examples include a program to translate from the declarative Regular Expression formalism into the executable Finite State Machine notation, and a Pascal compiler written in Logo.
The Logo programs in these books and the author's free Berkeley Logo interpreter are available via the Internet or on diskette.
目次
- 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).
「Nielsen BookData」 より