The Haskell Road to Logic, Maths and Programming (Texts in Computing) [Paperback]

Kees Doets (Author), van Jan Eijck (Author)

Product Details

• Paperback: 444 pages
• Publisher: College Publications (May 7, 2004)
• Language: English
• ISBN-10: 0954300696
• ISBN-13: 978-0954300692
• Product Dimensions: 8.9 x 5.9 x 1.1 inches
• Shipping Weight: 1.4 pounds (View shipping rates and policies)
• Average Customer Review: 4.8 out of 5 stars  See all reviews (9 customer reviews)
• Amazon Best Sellers Rank: #131,466 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

61 of 67 people found the following review helpful:

5.0 out of 5 stars The Haskell Road to Discrete Math, April 9, 2006

By 

John J. Rood (Holbrook, MA USA) - See all my reviews
(REAL NAME)   

This review is from: The Haskell Road to Logic, Maths and Programming (Texts in Computing) (Paperback)

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.

16 of 16 people found the following review helpful:

5.0 out of 5 stars The math book all programmers should read, December 2, 2009

By 

Code Monkey - See all my reviews

This review is from: The Haskell Road to Logic, Maths and Programming (Texts in Computing) (Paperback)

The 'Haskell Road to Logic' is a wonderful introduction to the mathematics that lie behind functional programming and computer science. Readers should however be aware that this book is not, and does not pretend to be, a book about programming in Haskell. It is really a text book about topics in mathematics that are of particular interest to computer scientists. What distinguishes the book from many others is its use of Haskell to implement mathematical structures that are usually taught as abstract concepts. This approach makes the mathematics far more approachable for computer programmers than many other text books. Presumably it should also make for an excellent introduction to computer programming for the mathematically inclined.

While the book is easy to read and has a friendly writing style, it not particularly well suited to casual reading. To really understand the subject being discussed the reader will probably need to solve most of the exercises in the text. The good news is this requires minimal prior mathematical training (the authors expect familiarity with "secondary school mathematics"). Solving the exercises will also train the reader in writing, and proving the correctness of, short functional programs.

The book has a minor few faults. One is a relatively large number of minor errors (many of which are noted in the errata available on the book's website). Another is that some major topics are introduced in exercises without much discussion, particularly in the later chapters. But these are but quibbles in a review of a fantastic math book for programmers.

11 of 13 people found the following review helpful:

5.0 out of 5 stars modern approach to Mathematics foundations, June 7, 2009

By 

Herbert C. Meyer (Shelbyville, KY, USA) - See all my reviews
(REAL NAME)   

Amazon Verified Purchase

This review is from: The Haskell Road to Logic, Maths and Programming (Texts in Computing) (Paperback)

When I was a Math undergrad back in the 70's, we had a 5 hr course called Foundations of Mathematics. This was an intro to symbolic logic, propositional calculus, and methods of proof. Deadly boring, dry material that we either knew, grasped by intuition, or ignored.

This textbook covers this material in a constructive fashion by using the Haskell programming language. Haskell is a modern form of lisp, one of the original programming languages, from the '50's, the language used for most Artificial Intelligence work. The breadth of Haskell allows it to be used for logic and proof, as well as the usual numerical and string processing. Pattern matching and list processing is built into the basic structure of the Haskell language.

This text's exercises are mostly Haskell programming assignments. Turning the abstract ideas of the math into the concrete statements of Haskell (if statements in a program can be considered concrete) will make the ideas familiar and real. Free, useful versions of Haskell (Hugs) are available for readers or students to use, even on Windows systems. Any familiarity with any programming system and a text editor should be enough to get started.

What is the difference between proving a theorem and debugging a program ? The way I do it, not much. That has much to do with me, I am a programmer first, and a Math second. This statement is the Curry-Howard correspondence, connecting computability and proof or truth. This text is a step on that road to truth.

There are several other titles in this series. All of them sound fascinating. I will read them later.