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 would b...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2020
|
| Links: | https://doi.org/10.1017/9781108869041 |
| Zusammenfassung: | 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. |
| Umfang: | 1 Online-Ressource (xvi, 437 Seiten) |
| ISBN: | 9781108869041 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781108869041 | ||
| 003 | UkCbUP | ||
| 005 | 20200706105231.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 190912s2020||||enk o ||1 0|eng|d | ||
| 020 | |a 9781108869041 | ||
| 100 | 1 | |a Bird, Richard |d 1943- | |
| 245 | 1 | 0 | |a Algorithm design with Haskell |c Richard Bird, Jeremy Gibbons |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2020 | |
| 300 | |a 1 Online-Ressource (xvi, 437 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 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. | ||
| 700 | 1 | |a Gibbons, Jeremy |d 1966- | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781108491617 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/9781108869041 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781108869041 |
|---|---|
| _version_ | 1825574047040143360 |
| adam_text | |
| any_adam_object | |
| author | Bird, Richard 1943- |
| author2 | Gibbons, Jeremy 1966- |
| author2_role | |
| author2_variant | j g jg |
| author_facet | Bird, Richard 1943- Gibbons, Jeremy 1966- |
| author_role | |
| author_sort | Bird, Richard 1943- |
| author_variant | r b rb |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01757nam a2200253 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781108869041</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20200706105231.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">190912s2020||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108869041</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bird, Richard</subfield><subfield code="d">1943-</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithm design with Haskell</subfield><subfield code="c">Richard Bird, Jeremy Gibbons</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2020</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xvi, 437 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gibbons, Jeremy</subfield><subfield code="d">1966-</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781108491617</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/9781108869041</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781108869041 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:58:01Z |
| institution | BVB |
| isbn | 9781108869041 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xvi, 437 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2020 |
| publishDateSearch | 2020 |
| publishDateSort | 2020 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Bird, Richard 1943- Algorithm design with Haskell Richard Bird, Jeremy Gibbons Cambridge Cambridge University Press 2020 1 Online-Ressource (xvi, 437 Seiten) txt c cr 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. Gibbons, Jeremy 1966- Erscheint auch als Druck-Ausgabe 9781108491617 |
| spellingShingle | Bird, Richard 1943- Algorithm design with Haskell |
| title | Algorithm design with Haskell |
| title_auth | Algorithm design with Haskell |
| title_exact_search | Algorithm design with Haskell |
| title_full | Algorithm design with Haskell Richard Bird, Jeremy Gibbons |
| title_fullStr | Algorithm design with Haskell Richard Bird, Jeremy Gibbons |
| title_full_unstemmed | Algorithm design with Haskell Richard Bird, Jeremy Gibbons |
| title_short | Algorithm design with Haskell |
| title_sort | algorithm design with haskell |
| work_keys_str_mv | AT birdrichard algorithmdesignwithhaskell AT gibbonsjeremy algorithmdesignwithhaskell |