Algorithm design with Haskell
"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 w...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Další autoři: | |
| Médium: | Kniha |
| Jazyk: | angličtina |
| Vydáno: |
Cambridge, United Kingdom ; New York, ; Port Melbourne ; New Delhi ; Singapore :
Cambridge University Press,
2020
|
| Žánr/forma: | učebnice |
| ISBN: | 978-1-108-49161-7 |
| Témata: | |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|
| Jiná forma: | Elektronická verze |
| LEADER | 02976cam a2200469 i 4500 | ||
|---|---|---|---|
| 001 | 001877531 | ||
| 003 | CZ PrSTK | ||
| 005 | 20220912132613.0 | ||
| 007 | ta | ||
| 008 | 210831s2020 xxka f 001 0 eng d | ||
| 020 | |a 978-1-108-49161-7 |q (vázáno) | ||
| 040 | |a OLD012 |b cze |d ABA013 |e rda | ||
| 044 | |a xxk |a xxu |a at |a ii |a si | ||
| 050 | 0 | |a QA76.9.A43 |b B57 2020 | |
| 072 | 7 | |a 004.4/.6 |x Programování. Software |2 Konspekt |9 23 | |
| 072 | 7 | |a 37.016 |x Učební osnovy. Vyučovací předměty. Učebnice |2 Konspekt |9 22 | |
| 080 | |a 004.42.046 |2 MRF | ||
| 080 | |a 004.421 |2 MRF | ||
| 080 | |a 004.438Haskell |2 MRF | ||
| 080 | |a (075) |2 MRF | ||
| 100 | 1 | |a Bird, Richard, |d 1943- |7 mub2011640961 |4 aut | |
| 245 | 1 | 0 | |a Algorithm design with Haskell / |c Richard Bird, Jeremy Gibbons |
| 250 | |a First published | ||
| 264 | 1 | |a Cambridge, United Kingdom ; |a New York, ; |a Port Melbourne ; |a New Delhi ; |a Singapore : |b Cambridge University Press, |c 2020 | |
| 300 | |a xvi, 437 stran : |b ilustrace ; |c 25 cm | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a bez média |b n |2 rdamedia | ||
| 338 | |a svazek |b nc |2 rdacarrier | ||
| 504 | |a Obsahuje bibliografie, bibliografické odkazy a rejstřík | ||
| 520 | |a "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."--Nakladatelská anotace | ||
| 650 | 0 | 7 | |a funkcionální programování |x if |7 psh6639 |2 psh |
| 650 | 0 | 7 | |a algoritmizace |x vt |7 psh12472 |2 psh |
| 650 | 0 | 7 | |a programovací jazyk Haskell |x vt |7 psh13866 |2 psh |
| 650 | 0 | 7 | |a algoritmy (programování) |7 ph131788 |2 czenas |
| 650 | 0 | 7 | |a funkcionální programování |7 ph572639 |2 czenas |
| 650 | 0 | 7 | |a Haskell (programovací jazyk) |7 ph903880 |2 czenas |
| 655 | 7 | |a učebnice |7 fd133770 |2 czenas | |
| 690 | |a Haskell | ||
| 700 | 1 | |a Gibbons, Jeremy, |d 1966- |7 stk2007415426 |4 aut | |
| 910 | |a ABA013 |b B 19994 | ||
| 996 | |a STK |b 2660514369 |c 1265/2022 |d 20220831 |f 960.00 |g B 19994 |v QA76 .9 .A43 B57 2020 |l 6.NP, regál 6D/074 |t 03 |0 K | ||
| 998 | |a PAR |b 001808182 |l STK01 |m Algorithm design with Haskell / |n Algorithm design with Haskell / | ||