| 000 | 03426camuu2200325 a 4500 | |
| 001 | 000045687714 | |
| 005 | 20120126180233 | |
| 008 | 120126s2010 enka b 001 0 eng d | |
| 010 | ▼a 2010022871 | |
| 015 | ▼a GBB067282 ▼2 bnb | |
| 020 | ▼a 9780521513388 (hardback) | |
| 020 | ▼a 0521513383 (hardback) | |
| 035 | ▼a (KERIS)REF000016331249 | |
| 040 | ▼a DLC ▼c DLC ▼d YDX ▼d YDXCP ▼d CDX ▼d IUL ▼d UKM ▼d BTCTA ▼d CUD ▼d DLC ▼d 211009 | |
| 050 | 0 0 | ▼a QA76.62 ▼b .B57 2010 |
| 082 | 0 0 | ▼a 006.3/1 ▼2 22 |
| 084 | ▼a 006.31 ▼2 DDCK | |
| 090 | ▼a 006.31 ▼b B618p | |
| 100 | 1 | ▼a Bird, Richard, ▼d 1943-. |
| 245 | 1 0 | ▼a Pearls of functional algorithm design / ▼c Richard Bird. |
| 260 | ▼a Cambridge ; ▼a New York : ▼b Cambridge University Press, ▼c 2010. | |
| 300 | ▼a xi, 277 p. : ▼b ill. ; ▼c 26 cm. | |
| 504 | ▼a Includes bibliographical references and index. | |
| 505 | 0 | ▼a 1. The smallest free number -- 2. A surpassing problem -- 3. Improving on saddleback search -- 4. A selection problem -- 5. Sorting pairwise sums -- 6. Making a century -- 7. Building a tree with minimum height -- 8. Unravelling greedy algorithms -- 9. Finding celebrities -- 10. Removing duplicates -- 11. Not the maximum segment sum -- 12. Ranking suffixes -- 13. The Burrows-Wheeler transform -- 14. The last tail -- 15. All the common prefixes -- 16. The Boyer-Moore algorithm -- 17. The Knuth-Morris-Pratt algorithm -- 18. Planning solves the rush hour problem -- 19. A simple Sudoku solver -- 20. The countdown problem -- 21. Hylomorphisms and nexuses -- 22. Three ways of computing determinants -- 23. Inside the convex hull -- 24. Rational arithmetic coding -- 25. Integer arithmetic coding -- 26. The Schorr-Waite algorithm -- 27. Orderly insertion -- 28. Loopless functional algorithms -- 29. The Johnson-Trotter algorithm -- 30. Spider spinning for dummies. |
| 520 | ▼a "Richard Bird takes a radically new approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particular programming problem drawn from sources as diverse as games and puzzles, intriguing combinatorial tasks, and more familiar areas such as data compression and string matching. Each pearl starts with the statement of the problem expressed using the functional programming language Haskell, a powerful yet succinct language for capturing algorithmic ideas clearly and simply. The novel aspect of the book is that each solution is calculated from an initial formulation of the problem in Haskell by appealing to the laws of functional programming. Pearls of Functional Algorithm Design will appeal to the aspiring functional programmer, students and teachers interested in the principles of algorithm design, and anyone seeking to master the techniques of reasoning about programs in an equational style"-- ▼c Provided by publisher. | |
| 520 | ▼a "The novel aspect of the book is that each solution is calculated from the problem statement by appealing to the laws of functional programming. Pearls of Functional Algorithm Design will appeal to the aspiring functional programmer, students and teachers interested in the principles of algorithm design, and anyone seeking to master the techniques of reasoning about programs in an equational style"-- ▼c Provided by publisher. | |
| 650 | 0 | ▼a Functional programming (Computer science) |
| 650 | 0 | ▼a Computer algorithms. |
| 945 | ▼a KLPA |
Holdings Information
| No. | Location | Call Number | Accession No. | Availability | Due Date | Make a Reservation | Service |
|---|---|---|---|---|---|---|---|
| No. 1 | Location Science & Engineering Library/Sci-Info(Stacks2)/ | Call Number 006.31 B618p | Accession No. 121216535 | Availability Available | Due Date | Make a Reservation | Service |
Contents information
Book Introduction
This book takes a radical approach to algorithm design, namely, design by calculation.
Richard Bird takes a radical approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particular programming problem drawn from sources as diverse as games and puzzles, intriguing combinatorial tasks, and more familiar areas such as data compression and string matching. Each pearl starts with the statement of the problem expressed using the functional programming language Haskell, a powerful yet succinct language for capturing algorithmic ideas clearly and simply. The novel aspect of the book is that each solution is calculated from an initial formulation of the problem in Haskell by appealing to the laws of functional programming. Pearls of Functional Algorithm Design will appeal to the aspiring functional programmer, students and teachers interested in the principles of algorithm design, and anyone seeking to master the techniques of reasoning about programs in an equational style.
Information Provided By: :
Author Introduction
리처드 버드(지은이)
영국 왕립원예학회(Royal Horticultural Society, RHS)의 위원으로 30여 권에 달하는 다양한 원예학 관련 저서를 출간한 원예전문가이다. 내한성 다년생 식물이나 고산식물에 대한 강연을 주로 진행하며, 일반인도 알기 쉽게 배울 수 있는 정원 가꾸기 노하우를 전파하고자 활발히 활동 중이다. 지은 책으로 『일년생 초화류 활용하기(Making the Most of Annuals in the Garden)』, 『미니 정원 프로젝트 (Project for Small Gardens)』, 『고산식물 정원 가꾸기 완전 정복(The Complete Book of Alpine Gardening)』, 『허브와 텃밭 정원사(Kitchen and Herb Gardener)』, 『가지치기 실용가이드(Ultimate Practical Guide to Pruning and Training)』, 『허브 기르기(Growing Herbs)』, 『완두콩과 콩, 그리고 새싹 기르기(Growing Shoots, Peas and Beans)』, 『토마토 기르기(Growing Tomatoes)』, 『뿌리채소 기르기 (Growing Root Vegetables)』 등이 있다.
Table of Contents
Preface; 1. The smallest free number; 2. A surpassing problem; 3. Improving on saddleback search; 4. A selection problem; 5. Sorting pairwise sums; 6. Making a century; 7. Building a tree with minimum height; 8. Unravelling greedy algorithms; 9. Finding celebrities; 10. Removing duplicates; 11. Not the maximum segment sum; 12. Ranking suffixes; 13. The Burrows-Wheeler transform; 14. The last tail; 15. All the common prefixes; 16. The Boyer-Moore algorithm; 17. The Knuth-Morris-Pratt algorithm; 18. Planning solves the rush hour problem; 19. A simple Sudoku solver; 20. The countdown problem; 21. Hylomorphisms and nexuses; 22. Three ways of computing determinants; 23. Inside the convex hull; 24. Rational arithmetic coding; 25. Integer arithmetic coding; 26. The Schorr-Waite algorithm; 27. Orderly insertion; 28. Loopless functional algorithms; 29. The Johnson-Trotter algorithm; 30. Spider spinning for dummies; Index.
Information Provided By: :