blob: 61bfbc795bd502f5e617a0ad3e9c13056a749632 (
plain) (
tree)
|
|
<HTML>
<HEAD>
<TITLE>Simply Scheme part VII introduction</TITLE>
</HEAD>
<BODY>
<CITE>Simply Scheme</CITE> 2/e Copyright (C) 1999 MIT
<H1>Conclusion: Computer Science</H1>
<TABLE><TR><TD>
<P><IMG SRC="simply.jpg" ALT="cover photo">
<TD valign="center">
<CITE><A HREF="http://www.cs.berkeley.edu/~bh/">Brian
Harvey</A><BR><A HREF="http://www.cnmat.berkeley.edu/~matt">Matthew
Wright</A><BR>University of California, Berkeley</CITE>
<BR><BR><A HREF="http://www-mitpress.mit.edu/book-home.tcl?isbn=0262082810">MIT
Press web page for Simply Scheme</A>
</TABLE>
<P><A HREF="simply-toc.html">(back to Table of Contents)</A>
<HR>
<P>This is the end of the technical material in this book. We've
explored the big ideas of composition of functions, functions as data,
recursion, abstraction, and sequential programming. As a review, you might
enjoy rereading Chapter 1 to see how the formerly mysterious
examples now make sense.
<P>This book is intended both as a standalone programming course for people
whose main interest is in something else and as preparation for those who
intend to continue studying computer science. The final chapter is directed
mainly at the latter group, to tell them what to expect. We confess,
though, to the hope that some of the former may have enjoyed this experience
enough to be lured into further study. If you're in that category, you'll
be particularly interested in a preview of coming attractions.
<P><A HREF="simply-toc.html">(back to Table of Contents)</A>
</BODY>
</HTML>
|