Introduction to functional programming using Haskell
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.
49 pages matching declaration in this book
Results 1-3 of 49
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abstr apply approx Arblnt argument binary heap binary search tree binary tree Bool Btree calculation Char characters computation concat constructors datatype declaration define a function definition denote digits efficient elements empty eval evaluation example exercise Expr expression filter finite flatcat flatten Float foldl foldn foldr Fork xt functional composition functional programming functor getChar Haskell height hiext implementation induction infinite list inits insert instance Integer isEmpty iterate laws lazy evaluation Leaf list comprehensions list of length lists xs map f Meertens mkBtree MkOut monad monad transformer natural numbers Node nonempty list Null operations pair parser proof prove putChar qsort queue quicksort recursive reduction representation result reverse scanl Section sequence sortby square steps Stree String subtrees Succ Succ Succ Zero takes takeWhile tuple type class xmatchlist xs h xt yt