## An Introduction to Functional ProgrammingThis is a thorough introduction to the fundamental concepts of functional programming.The book clearly expounds the construction of functional programming as a process of mathematical calculation, but restricts itself to the mathematics relevant to actual program construction. It covers simple and abstract datatypes, numbers, lists, examples, trees, and efficiency. It includes a simple, yet coherent treatment of the Haskell class; a calculus of time complexity; and new coverage of monadic input-output. |

### From inside the book

87 pages matching **introduction to functional programming** in this book

#### Page iv

Where's the rest of this book?

Results 1-3 of 87

### What people are saying - Write a review

#### Review: Introduction to Functional Programming

User Review - Peteris Erins - GoodreadsWhile set up as an introductory book to languages of the Haskell family, the book actually has a fair share of theory which modern tutorials of Haskell lack. It presents a simple model of evaluation ... Read full review

#### Review: Introduction to Functional Programming

User Review - GoodreadsWhile set up as an introductory book to languages of the Haskell family, the book actually has a fair share of theory which modern tutorials of Haskell lack. It presents a simple model of evaluation ... Read full review

### Common terms and phrases

abstr aexp algorithm apply argument arithmetic bigit binary search trees binary tree bool btree Chapter char characters compute concat concatenation consider constructors curry define a function delete denotes depth efficient Eight Queens problem element empty equation evaluation example Exercises expression False filter finite foldl foldr Functional composition functional programming given graph reduction implementation induction infinite list init insert insertion sort integers iterate labels t2 list comprehension list xs lookup map f mapbtree mathematical merge sort minimax mkarray natural numbers Node non-empty list notation operations otherwise outermost reduction pair position problem proof prove queens quicksort recursive definition reduction steps representation represented result returns reverse xs sequence sneeuq solution square string structural induction subtree Succ Suppose synthesise Tagb takewhile term tl t2 True unlines variable words write xs H xs ys Zero