How to Design Programs: An Introduction to Programming and Computing / Edition 1

Hardcover (Print)
Rent from
(Save 75%)
Est. Return Date: 08/01/2015
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $19.60
Usually ships in 1-2 business days
(Save 76%)
Other sellers (Hardcover)
  • All (20) from $19.60   
  • New (8) from $68.29   
  • Used (12) from $19.48   


This introduction to programming places computer science in the core of a liberal arts education. Unlike other introductory books, it focuses on the program design process. This approach fosters a variety of skills—critical reading,analytical thinking, creative synthesis, and attention to detail—that are important for everyone, not just future computer programmers.The book exposes readers to two fundamentally new ideas. First, it presents program design guidelines that show the reader how to analyze a problem statement; how to formulate concise goals; how to make up examples; how to develop an outline of the solution, based on the analysis; how to finish the program; and how to test. Each step produces a well-defined intermediate product. Second, the book comes with a novel programming environment,the first one explicitly designed for beginners. The environment grows with the readers as they master the material in the book until it supports a full-fledged language for the whole spectrum of programming tasks.All the book's support materials are available for free on the Web. The Web site includes the environment,teacher guides, exercises for all levels, solutions, and additional projects.

Read More Show Less

Product Details

  • ISBN-13: 9780262062183
  • Publisher: MIT Press
  • Publication date: 2/12/2001
  • Edition description: New Edition
  • Edition number: 1
  • Pages: 728
  • Sales rank: 1,002,772
  • Product dimensions: 7.87 (w) x 9.00 (h) x 0.18 (d)

Meet the Author

Matthias Felleisen is Trustee Professor of Computer Science at Northeastern University, recipient of the Karl V. Karlstrom Outstanding Educator Award, and co-author (with Daniel Friedman) of The Little Schemer and three other "Little" books published by the MIT Press.

Robert Bruce Findler is Assistant Professor of Electrical Engineering and Computer Science at Northwestern University.

Matthew Flatt is Associate Professor in the School of Computing at the University of Utah.

Shriram Krishnamurthi is Assistant Professor of Computer Science at Brown University.

Read More Show Less

Table of Contents

List of Figures
I Processing Simple Forms of Data 3
1 Students, Teachers, and Computers 3
2 Numbers, Expressions, Simple Programs 5
3 Programs are Function Plus Variable Definitions 21
4 Conditional Expressions and Functions 29
5 Symbolic Information 46
6 Compound Data, Part 1: Structures 51
7 The Varieties of Data 79
Intermezzo 1: Syntax and Semantics 97
II Processing Arbitrarily Large Data 117
9 Compound Data, Part 2: Lists 117
10 More on Processing Lists 137
11 Natural Numbers 153
12 Composing Functions, Revisited Again 168
Intermezzo 2: List Abbreviations 183
III More on Processing Arbitrarily Large Data 189
14 More Self-referential Data Definitions 189
15 Mutually Referential Data Definitions 209
16 Development through Iterative Refinement 221
17 Processing Two Complex Pieces of Data 228
Intermezzo 3: Local Definitions and Lexical Scope 259
IV Abstracting Designs 283
19 Similarities in Definitions 283
20 Functions are Values 299
21 Designing Abstractions from Examples 306
22 Designing Abstractions with First-Class Functions 319
23 Mathematical Examples 334
Intermezzo 4: Defining Functions on the Fly 350
V Generative Recursion 357
25 A New Form of Recursion 357
26 Designing Algorithms 368
27 Variations on a Theme 381
28 Algorithms that Backtrack 406
Intermezzo 5: The Cost of Computing and Vectors 417
VI Accumulating Knowledge 441
30 The Loss of Knowledge 441
31 Designing Accumulator-Style Functions 450
32 More Uses of Accumulation 466
Intermezzo 6: The Nature of Inexact Numbers 478
VII Changing the State of Variables 491
34 Memory for Functions 491
35 Assignment to Variables 496
36 Designing Functions with Memory 507
37 Examples of Memory Usage 521
Intermezzo 7: The Final Syntax and Semantics 548
VIII Changing Compound Values 573
39 Encapsulation 573
40 Mutable Structures 587
41 Designing Functions that Change Structures 608
42 Equality 637
43 Changing Structures, Vectors, and Objects 642
Epilogue 677
Index 683
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)