Introduction to Functional Programming Using Haskell

Front Cover
Prentice Hall Europe, 1998 - Computers - 433 pages

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.

From inside the book

 

Your search - coproducts - did not match any documents.

Try this search over all volumes: coproducts

Results 1-0 of 0

Contents

Simple datatypes
29
Numbers
57
8
89
Copyright

13 other sections not shown

Other editions - View all

Introduction to Functional Programming Using Haskell
Richard Bird
Limited preview - 1998
Introduction to Functional Programming Using Haskell
Richard Bird
Snippet view - 1998

Common terms and phrases

abstr apply approx ArbInt argument binary heap binary search tree binary tree Bool Btree calculation Char characters computation concat map datatype declaration definition denote digits efficient elements empty eval evaluation example exercise Expr expression f xs False filter finite flatcat flatten Float foldl foldn foldr Fork xt 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 matchlist Meertens mkBtree MkOut monad monad transformer natural numbers 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 tail takeWhile tuple type class xs ys xt yt

References to this book

Bibliographic information

TitleIntroduction to Functional Programming Using Haskell
Prentice Hall series in computer science
AuthorRichard Bird
Edition2, illustrated, reprint
PublisherPrentice Hall Europe, 1998
Original fromthe University of Michigan
DigitizedNov 16, 2007
ISBN0134843460, 9780134843469
Length433 pages
Subjects ›  › 

Computers / General
Computers / Programming / General
Computers / Software Development & Engineering / Systems Analysis & Design
  
Export CitationBiBTeX EndNote RefMan