After the success of the first edition of Introduction to Functional Programming, the authors have thoroughly updated and revised this bestselling title. This book is unusual amongst books on functional programming in that it is primarily directed towards the concepts of functional programming, rather than their realization in a specific programming language. The book clearly expounds the construction of functional programs as a process of mathematical calculation, but the mathematics is restricted to that relevant to the actual construction of programs.
FREE Two-Day Shipping for Students. Learn more |
| ||||||||||||
 Sell Back Your Copy for $25.62
Whether you buy it used on Amazon for $55.49 or somewhere else, you can sell it back through our Book Trade-In Program at the current price of $25.62.
Used Price$55.49
Trade-in Price$25.62
Price after
Trade-in$29.87 |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Frequently Bought Together
Editorial Reviews
From the Back Cover
After the success of the first edition, Introduction to Functional Programming using Haskell has been thoroughly updated and revised to provide a complete grounding in the principles and techniques of programming with functions. The second edition uses the popular language Haskell to express functional programs. There are new chapters on program optimisation, abstract datatypes in a functional setting, and programming in a monadic style. There are complete new case studies, and many new exercises. As in the first edition, there is an emphasis on the fundamental techniques for reasoning about functional programs, and for deriving them systematically from their specifications. The book is self-contained, assuming no prior knowledge of programming and is suitable as an introductory undergraduate text for first- or second-year students.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Authors
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
21 of 24 people found the following review helpful:
4.0 out of 5 stars
Original classic, theoretical,
By nunb (Seattle) - See all my reviews
This review is from: Introduction to Functional Programming using Haskell (2nd Edition) (Paperback)
Bird and Wadler got me started on functional programming. Before that, I'd only seen discussions of C++/STL functors and functions like for, map etcetera.
B&W was dense, and magic. It reminded me of the first time I read the K&R C book, you're following along fine, and all of a sudden you're off the deep end! The syntax, sort of ML-like adds to the 'magic' feel of it all. Overall I think it's a good book. But like with K&R, make this your second or third book, to ground you in the fundamentals after you've become somewhat familiar with the syntax and application of a particular fnal language. That said, it covers a wide breadth of topics, and does justice to them as well. But this opinion comes from a newbie at functional programming, so caveat lector! For me, it made me realise that there was a whole 'new' way of programming, vastly bigger than the few functions C++ had in its STL, and that C++ syntax mostly got in the way. However, perhaps because of this book, I never quite grokked Haskell/ML syntax either, though LISP I find easy (easier).
7 of 34 people found the following review helpful:
3.0 out of 5 stars
Nice book on functional programming,
By A Customer
This review is from: Introduction to Functional Programming using Haskell (2nd Edition) (Paperback)
This is a good introduction to functional programming.It is less language specific than some of the other books.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
succ zero, parser int, cross functor, strict succ, third duality theorem, binary heap trees, def cpp, show monad, datatype invariant, concat xss, output monad, cup intro, sortby name, second duality theorem, right unit law, first duality theorem, map snd, outermost reduction, map fst, monad laws, exception monad, perfect binary tree, combining monads, fusion theorem, longest initial segment Key Phrases - Capitalized Phrases (CAPs): (learn more)
False True, Fork Int, Btree Char, Hello World, Parser Expr, Fork Null, False Right, Parser Char, Con Int, Pair True, False Succ, Null Null, Cnum Int Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
succ zero, parser int, cross functor, strict succ, third duality theorem, binary heap trees, def cpp, show monad, datatype invariant, concat xss, output monad, cup intro, sortby name, second duality theorem, right unit law, first duality theorem, map snd, outermost reduction, map fst, monad laws, exception monad, perfect binary tree, combining monads, fusion theorem, longest initial segment Key Phrases - Capitalized Phrases (CAPs): (learn more)
False True, Fork Int, Btree Char, Hello World, Parser Expr, Fork Null, False Right, Parser Char, Con Int, Pair True, False Succ, Null Null, Cnum Int Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
94
books
cite this book:
See all 94 books citing this book
- Formal Program Development: IFIP TC2/WG 2.1 State-of-the-Art Report (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence) by Bernhard Möller on 4 pages
- Implementation of Functional Languages: 13th International Workshop, IFL 2001 Stockholm, Sweden, September 24-26, 2001 Selected Papers (Lecture Notes in Computer Science) by Thomas Arts on page 67, page 68, and page 86
- Functional Programming Languages and Computer Architecture: 5th ACM Conference. Cambridge, MA, USA, August 26-30, 1991 Proceedings (Lecture Notes in Computer Science) by John Hughes on page 8 (1), page 8 (2), and page 327
- On the Shape of Mathematical Arguments (Lecture Notes in Computer Science) by Antonetta J.M. van Gasteren on page 148, and Back Matter
- Discrete Mathematics Using a Computer by Cordelia Hall on page 31, and Back Matter
See all 94 books citing this book
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
|
|
So You'd Like to...
|
|
Look for Similar Items by Category
- Books > Computers & Technology > Computer Science > Systems Analysis & Design
- Books > Computers & Technology > Programming > Functional
- Books > Computers & Technology > Programming > Introductory & Beginning
- Books > Computers & Technology > Software
- Books > New & Used Textbooks > Computer Science > Programming Languages
