 |
ISBN
| 9781108491617 | |
DDC
| 005.13 | |
Tác giả CN
| Bird, Richard | |
Nhan đề
| Algorithm design with Haskell / Richard Bird, Jeremy Gibbons | |
Thông tin xuất bản
| London : Cambridge University Press, 2020 | |
Mô tả vật lý
| 450 p. ; 27 cm. | |
Tóm tắt
| This book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would be obtained with imperative languages. Carefully selected examples, both new and standard, reveal the commonalities and highlight the differences between algorithms. The algorithm developments use equational reasoning where applicable, clarifying the applicability conditions and correctness arguments. Every chapter concludes with exercises (nearly 300 in total), each with complete answers, allowing the reader to consolidate their understanding and apply the techniques to a range of problems. The book serves students (both undergraduate and postgraduate), researchers, teachers, and professionals who want to know more about what goes into a good algorithm and how such algorithms can be expressed in purely functional terms | |
Từ khóa tự do
| Computer algorithms | |
Từ khóa tự do
| Functional programming (Computer science) | |
Từ khóa tự do
| Haskell (Computer program language) | |
Tác giả(bs) CN
| Gibbons, Jeremy | |
Địa chỉ
| 300Q12_Kho Mượn_1A(1): M000761 |
| |
000
| 00000nam#a2200000ui#4500 |
|---|
| 001 | 41444 |
|---|
| 002 | 2 |
|---|
| 004 | B1BBBD8F-0A8D-4CFE-A498-E116961797AB |
|---|
| 005 | 202305101438 |
|---|
| 008 | 230510s2020 enk eng |
|---|
| 009 | 1 0 |
|---|
| 020 | |a9781108491617 |
|---|
| 039 | |y20230510143811|ztainguyendientu |
|---|
| 040 | |aNTT |
|---|
| 041 | |avie |
|---|
| 044 | |avm |
|---|
| 082 | |a005.13|bB6181R|223 |
|---|
| 100 | |aBird, Richard |
|---|
| 245 | |aAlgorithm design with Haskell / |cRichard Bird, Jeremy Gibbons |
|---|
| 260 | |aLondon : |bCambridge University Press, |c2020 |
|---|
| 300 | |a450 p. ; |c27 cm. |
|---|
| 520 | |aThis book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would be obtained with imperative languages. Carefully selected examples, both new and standard, reveal the commonalities and highlight the differences between algorithms. The algorithm developments use equational reasoning where applicable, clarifying the applicability conditions and correctness arguments. Every chapter concludes with exercises (nearly 300 in total), each with complete answers, allowing the reader to consolidate their understanding and apply the techniques to a range of problems. The book serves students (both undergraduate and postgraduate), researchers, teachers, and professionals who want to know more about what goes into a good algorithm and how such algorithms can be expressed in purely functional terms |
|---|
| 653 | |aComputer algorithms |
|---|
| 653 | |aFunctional programming (Computer science) |
|---|
| 653 | |aHaskell (Computer program language) |
|---|
| 700 | |aGibbons, Jeremy |
|---|
| 852 | |a300|bQ12_Kho Mượn_1A|j(1): M000761 |
|---|
| 856 | 1|uhttp://elib.ntt.edu.vn/documentdata01/2 tailieuthamkhao/000 tinhocthongtin/anhbiasach/algorithmdesignwithhaskellthumbimage.jpg |
|---|
| 890 | |a1|b0|c0|d0 |
|---|
| |
| Dòng |
Mã vạch |
Nơi lưu |
S.gọi Cục bộ |
Phân loại |
Bản sao |
Tình trạng |
Thành phần |
Đặt chỗ |
|
1
|
M000761
|
Q12_Kho Mượn_1A
|
005.13 B6181R
|
Sách mượn về nhà
|
1
|
|
|
|
Không có liên kết tài liệu số nào
|
|
|
|