Beschreibung
Computer science abounds with applications of discrete mathematics, yet s- dents of computer science often study discrete mathematics in the context of purely mathematical applications. They have to ?gure out for themselves how to apply the ideas of discrete mathematics to computing problems. It is not easy. Most students fail to experience broad success in this enterprise, which is not surprising, since many of the most important advances in science and engineeringhavebeen, precisely, applicationsofmathematicstospeci?cscience and engineering problems. Tobesure,mostdiscretemathtextbooksincorporatesomeaspectsapplying discrete math to computing, but it usually takes the form of asking students to write programs to compute the number of three-ball combinations there are in a set of ten balls or, at best, to implement a graph algorithm. Few texts ask students to use mathematical logic to analyze properties of digital circuits or computer programs or to apply the set theoretic model of functions to understand higher-order operations. A major aim of this text is to integrate, tightly, the study of discrete mathematics with the study of central problems of computer science.
Inhaltsverzeichnis
Introduction to Haskell.- Equational Reasoning.- Recursion.- Induction.- Trees.- Propositional Logic.- Predicate Logic.- Set Theory.- Inductively Defined Sets.- Relations.- Functions.- The AVL Tree Miracle.- Discrete Mathematics in Circuit Design.- Appendix A: Software Tools.- Appendix B: Resources on the Web.- Appendix C: Solutions to Selected Exercises.- Bibliography.- Index.
