Introduction to Functional ProgrammingPrentice Hall, 1988 - 293 Seiten This 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. |
Inhalt
Fundamental Concepts | 1 |
Basic Data Types | 16 |
Lists | 48 |
Urheberrecht | |
7 weitere Abschnitte werden nicht angezeigt.
Häufige Begriffe und Wortgruppen
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 dropwhile 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 labels t2 length list comprehension list zs lookup map f map sqr mapbtree mathematical merge sort minimax Miranda 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 sequence sneeuq solution sqrt square string structural induction subtree Succ Suppose synthesise takewhile True unlines variable words write x:xs xs ys Zero