Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.

The Haskell Road to Logic, Maths and Programming. Second Edition (Texts in Computing)

4.4 out of 5 stars 18 customer reviews
ISBN-13: 978-0954300692
ISBN-10: 0954300696
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Trade in your item
Get a $2.33
Gift Card.
Have one to sell? Sell on Amazon

Sorry, there was a problem.

There was an error retrieving your Wish Lists. Please try again.

Sorry, there was a problem.

List unavailable.
Buy used On clicking this link, a new layer will be open
$15.55 On clicking this link, a new layer will be open
Buy new On clicking this link, a new layer will be open
$21.61 On clicking this link, a new layer will be open
More Buying Choices
27 New from $17.38 20 Used from $15.55
Free Two-Day Shipping for College Students with Prime Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Free Kaplan PSAT/NMSQT 2017 eTextbook with 2 Practice Tests
Prep smarter, not harder with the Kaplan "PSAT/NMSQT 2017 Strategies, Practice & Review" eTextbook. Sponsored by Kaplan. Download Now
$21.61 FREE Shipping on orders with at least $25 of books. Only 4 left in stock (more on the way). Ships from and sold by Amazon.com. Gift-wrap available.
click to open popover

Frequently Bought Together

  • The Haskell Road to Logic, Maths and Programming. Second Edition (Texts in Computing)
  • +
  • Learn You a Haskell for Great Good!: A Beginner's Guide
  • +
  • An Introduction to Functional Programming Through Lambda Calculus (Dover Books on Mathematics)
Total price: $73.62
Buy the selected items together

Customers Viewing This Page May Be Interested In These Sponsored Links

  (What's this?)
NO_CONTENT_IN_FEATURE
New York Times best sellers
Browse the New York Times best sellers in popular categories like Fiction, Nonfiction, Picture Books and more. See more

Product Details

  • Series: Texts in Computing
  • Paperback: 450 pages
  • Publisher: College Publications (May 7, 2004)
  • Language: English
  • ISBN-10: 0954300696
  • ISBN-13: 978-0954300692
  • Product Dimensions: 6.1 x 1 x 9.2 inches
  • Shipping Weight: 1.4 pounds (View shipping rates and policies)
  • Average Customer Review: 4.4 out of 5 stars  See all reviews (18 customer reviews)
  • Amazon Best Sellers Rank: #380,072 in Books (See Top 100 in Books)

Customers Viewing This Page May Be Interested In These Sponsored Links

  (What's this?)

Customer Reviews

Top Customer Reviews

Format: 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.
Comment 29 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: 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.
7 Comments 74 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Paperback
After dabbling in several other programming languages I came across references to Haskell and quickly became interested in learning the language given (1) my disdain for over-sized and almost convoluted languages such as Java and C# and, (2) my background in Mathematics. Yes this is an interesting book that does an excellent job showing how well the abstraction of Mathematics can be quantified using Haskell yet, I do not believe that this book does any justice to those individuals the author claims the book is written for-"[t]his book does not assume the reader to have previous experience with either programming or construction of formal proof ...". Any inexperienced programmer or person with minimal Mathematical experience will, in no way, benefit from this book unless they have a quality teacher who can explain as well as expand on the material. In my humble opinion the person's who can utilize and benefit from this book are either semi-experienced functional programmers, young (possibly old) whiz-kids or the auto-didactic types who have the patience to refer to other sources for more explanation. As an example of the later claim, Exercise 1.10 asks the reader to "define a function called removeFst that removes the first occurrence of an integer m from a list of integers ..." without reference to working with/on lists. Further, this user defined function is expected to be used in the very next example (1.11) which, without assurance of the readers ability to define such a function, i.e. providing a solution, is pedagogically unsound. Either include a reference to the solution(s) on the authors website, include them in the book, or do a better job of NOT asking for chicken without providing the egg.

This is not meant to be a negative review!
Read more ›
2 Comments 32 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Most Recent Customer Reviews

Set up an Amazon Giveaway

The Haskell Road to Logic, Maths and Programming. Second Edition (Texts in Computing)
Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more about Amazon Giveaway
This item: The Haskell Road to Logic, Maths and Programming. Second Edition (Texts in Computing)

Pages with Related Products. See and discover other items: mcgraw hill math