Programming in Haskell
Graham Hutton
- 出版商: Cambridge
- 出版日期: 2007-01-15
- 售價: $980
- 貴賓價: 9.8 折 $960
- 語言: 英文
- 頁數: 184
- 裝訂: Paperback
- ISBN: 0521692695
- ISBN-13: 9780521692694
-
相關分類:
Functional-programming
無法訂購
買這商品的人也買了...
-
$3,390$3,221 -
$380$300 -
$650$514 -
$300$270 -
$760$600 -
$680$578 -
$600$474 -
$650$507 -
$1,870$1,777 -
$550$468 -
$270$213 -
$420$412 -
$620$490 -
$580$458 -
$880$695 -
$1,560$1,404 -
$290$226 -
$750$593 -
$600$480 -
$880$695 -
$1,550$1,473 -
$2,400$2,280 -
$1,400Hacking Exposed Web 2.0: Web 2.0 Security Secrets and Solutions
-
$550$435 -
$1,710$1,625
相關主題
商品描述
Description
Haskell is one of the leading languages for teaching functional programming, enabling students to write simpler and cleaner code, and to learn how to structure and reason about programs.
This introduction is ideal for beginners: it requires no previous programming experience and all concepts are explained from first principles via carefully chosen examples. Each chapter includes exercises that range from the straightforward to extended projects, plus suggestions for further reading on more advanced topics. The author is a leading Haskell researcher and instructor, well-known for his teaching skills. The presentation is clear and simple, and benefits from having been refined and class-tested over several years. The result is a text that can be used with courses, or for self-learning. Features include freely accessible Powerpoint slides for each chapter, solutions to exercises and examination questions (with solutions) available to instructors, and a downloadable code that’s fully compliant with the latest Haskell release.
• Fully compliant with recently published definition of Haskell, and the first new textbook since this has been completed
• Powerpoint slides for each chapter freely available on the web
• Instructors can obtain solutions to each chapter’s exercises, together with a large collection of exam questions (and their solutions) via www.cambridge.org/9780521692694
Preface; 1. Introduction; 2. First steps; 3. Types and classes; 4. Defining functions; 5. List comprehensions; 6. Recursive functions; 7. Higher-order functions; 8. Functional parsers; 9. Interactive programs; 10. Declaring types and classes; 11. The countdown problem; 12. Lazy evaluation; 13. Reasoning about programs; Appendix A: a standard prelude; Appendix B: symbol table; Bibliography; Index.