|
The Haskell Road to Logic, Maths and Programming (Texts in Computing) | 
| Authors: Kees Doets, Van, Jan Eijck
Publisher: College Publications
Category: Book
List Price: $25.00
Buy New: $22.44
You Save: $2.56 (10%)
New (19) Used (7) from $16.99
Avg. Customer Rating:  2 reviews
Sales Rank: 271432
Media: Paperback
Number Of Items: 1
Pages: 444
Shipping Weight (lbs): 1.3
Dimensions (in): 8.8 x 6 x 1
ISBN: 0954300696
Dewey Decimal Number: 511
EAN: 9780954300692
ASIN: 0954300696
Publication Date: May 7, 2004
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Shipping: International shipping available
Condition: Brand new Book, ALL days Low Price !
|
| Similar Items:
|
| Customer Reviews:
The Haskell Road to Discrete Math April 9, 2006
38 out of 39 found this review helpful
Want to learn discrete math as in the non-calculus version of Math 101? Willing to work hard to learn it? Then this is the book for you! It is written in a user friendly style. The book has a chatty tone when explaining serious topics. The chat is the talk of experts, however, so it should never be underestimated. The book will teach you the functional programming language Haskell. This language is the most modern version of the Lisp family to have received any significant attention. It features advanced type features and lazy evaluation. The book covers all the "classic" topics of a discrete math course, to a considerable depth. Best of all, they are all implemented in Haskell. All except for the predicate calculus, that is. It would be a major piece of work indeed to have any implementation of this topic in a work at this level! The book teaches logic by example. One is taught the meaning, the rules and the insider's "recipes" of mathematical proofs. The book then covers the standard topics of sets, relations, functions, and induction / recursion with impressive computer implementations. The book goes on to a quick overview of the construction of the number systems of mathematics. It proceeds to a substantial treatment of combinatorics in a short space which includes implementation of polynomial solutions to recursion relations. Then it is on to corecursion, power series, and a hint of domain theory. The book ends with a modern chapter on the elements of set theory. All in all an excellent book! IMHO it is the best book out there on the topics in a discrete math course. It is amazing that all of this (except the serious parts of logic) could be implemented in Haskell so successfully. The one caveat about the book is that if you want to benefit fully from it, you are going to have to do some hard work.
I recommend every university library to have this book. March 17, 2006
16 out of 22 found this review helpful
In March 2006, there are only three or four books that boast Haskell in their titles. They are all excellent books. But the world can benefit from more Haskell books. In fact, we are in need of such books, especially CS1 texts. This book is a pleasure to read. I suspect that even math haters will not find it hostile. Anyone learning Haskell will find the book and its companion web site a valuable resouce. On the web site, you will find the source code from the book, such as Powerseries.hs. You can quickly play and experiment with it; read and learn from it.
I wish more books are as pleasant and affordable ($25).
|
|
|
Return to Math.com | | Sponsored Links |  |
|
|
|
