CiNii 図書 - Simply scheme : introducing computer science

An introductory level text for students who are not majoring in computer science, as well as for computer science majors with no prior programming experience. This text teaches computer science from a functional and symbolic point of view. It provides a solid platform from which students can go on to study the seminal work "Structure and Interpretation of Computer Programs". Beginners will find the authors' approach sophisticated yet conversational and unintimidating. Using Scheme, a modern dialect of Lisp, they teach fundamental ideas and concepts of computer science composition of functions, function as object, recursion, abstraction (data abstraction and procedural abstraction), and sequential (non-functional) techniques - in a way that avoids confusing technical pitfalls. Interesting non-mathematical programming examples use words and sentences as data; practical examples are represented by miniature spreadsheet and database programs. "Simply Scheme" devotes five chapters to recursion, presenting distinct ways for readers to think about this watershed idea. There is also a chapter on file input/output, and students are able to work on substantial, realistic programming projects in the first semester. Compared to Pascal- or C-based texts, "Simply Scheme" has many advantages in its use of the Scheme programming language. Scheme is interactive and allows for ease of program development and debugging; its functions and automatic storage allocation provide a high level of abstraction so that programmers can concentrate on the desired goal instead of on the computer; its simple, uniform syntax doesn't take up months of class time.

Part 1 Introduction - functions: showing off Scheme
functions. Part 2 Composition of functions: expressions
defining your own procedures
words and sentences
true and false. Part 3 Functions as data: higher-order functions
lambda
example - tic-tac-toe
variables. Part 4 Recursion: introduction to recursion
the leap of faith
how recursion works
common patterns in recursive procedures
advanced recursion
example - pattern matcher. Part 5 Abstraction: lists
trees
implementing higher-order functions. Part 6 Sequential programming
input and output
example - the functions program
files
vectors
example - a spreadsheet program
implementing the spreadsheet program. Part 7 Conclusion - computer science: what's next?. Appendices: running Scheme
common lisp
Scheme initialization file
GNU general public licence.

「Nielsen BookData」より

Simply scheme : introducing computer science

著者

書誌事項

大学図書館所蔵全24件

この図書・雑誌をさがす

注記

内容説明・目次

詳細情報

書き出し