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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
2020
|
| Subjects: | |
| Online Access: | DE-12 DE-92 DE-91 DE-91G DE-29 DE-739 Volltext |
| Summary: | 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 |
| Physical Description: | 1 Online-Ressource (xvi, 437 Seiten) |
| ISBN: | 9781108869041 |
| DOI: | 10.1017/9781108869041 |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV046815969 | ||
| 003 | DE-604 | ||
| 005 | 20250617 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200721s2020 xx o|||| 00||| eng d | ||
| 020 | |a 9781108869041 |c Online |9 978-1-108-86904-1 | ||
| 024 | 7 | |a 10.1017/9781108869041 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781108869041 | ||
| 035 | |a (OCoLC)1190911241 | ||
| 035 | |a (DE-599)BVBBV046815969 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-739 |a DE-92 |a DE-91G |a DE-29 | ||
| 082 | 0 | |a 005.13 | |
| 084 | |a ST 240 |0 (DE-625)143625: |2 rvk | ||
| 084 | |a DAT 362 |2 stub | ||
| 084 | |a DAT 530 |2 stub | ||
| 100 | 1 | |a Bird, Richard |d 1943- |0 (DE-588)123092213 |4 aut | |
| 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 |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 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 | ||
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Functional programming (Computer science) | |
| 650 | 4 | |a Haskell (Computer program language) | |
| 650 | 0 | 7 | |a HASKELL |0 (DE-588)4318275-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Funktionale Programmierung |0 (DE-588)4198740-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a HASKELL |0 (DE-588)4318275-6 |D s |
| 689 | 0 | 1 | |a Funktionale Programmierung |0 (DE-588)4198740-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Gibbons, Jeremy |d 1966- |0 (DE-588)1047093731 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Hardcover |z 978-1-108-49161-7 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781108869041 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-032224438 | |
| 966 | e | |u https://doi.org/10.1017/9781108869041 |l DE-12 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108869041 |l DE-92 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108869041 |l DE-91 |p ZDB-20-CBO |q TUM_Einzelkauf |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108869041 |l DE-91G |p ZDB-20-CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108869041 |l DE-29 |p ZDB-20-CBO |q UER_PDA_CBO_Kauf_2025 |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108869041 |l DE-739 |p ZDB-20-CBO |q UPA_PDA_CBO_Kauf2021 |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1835169956481728512 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Bird, Richard 1943- Gibbons, Jeremy 1966- |
| author_GND | (DE-588)123092213 (DE-588)1047093731 |
| author_facet | Bird, Richard 1943- Gibbons, Jeremy 1966- |
| author_role | aut aut |
| author_sort | Bird, Richard 1943- |
| author_variant | r b rb j g jg |
| building | Verbundindex |
| bvnumber | BV046815969 |
| classification_rvk | ST 240 |
| classification_tum | DAT 362 DAT 530 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781108869041 (OCoLC)1190911241 (DE-599)BVBBV046815969 |
| dewey-full | 005.13 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.13 |
| dewey-search | 005.13 |
| dewey-sort | 15.13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1017/9781108869041 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zc 4500</leader><controlfield tag="001">BV046815969</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20250617</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200721s2020 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108869041</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-108-86904-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781108869041</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781108869041</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1190911241</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046815969</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-29</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 240</subfield><subfield code="0">(DE-625)143625:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 362</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bird, Richard</subfield><subfield code="d">1943-</subfield><subfield code="0">(DE-588)123092213</subfield><subfield code="4">aut</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><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</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="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functional programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Haskell (Computer program language)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">HASKELL</subfield><subfield code="0">(DE-588)4318275-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Funktionale Programmierung</subfield><subfield code="0">(DE-588)4198740-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">HASKELL</subfield><subfield code="0">(DE-588)4318275-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Funktionale Programmierung</subfield><subfield code="0">(DE-588)4198740-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gibbons, Jeremy</subfield><subfield code="d">1966-</subfield><subfield code="0">(DE-588)1047093731</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Hardcover</subfield><subfield code="z">978-1-108-49161-7</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781108869041</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032224438</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108869041</subfield><subfield code="l">DE-12</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108869041</subfield><subfield code="l">DE-92</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108869041</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">TUM_Einzelkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108869041</subfield><subfield code="l">DE-91G</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108869041</subfield><subfield code="l">DE-29</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UER_PDA_CBO_Kauf_2025</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108869041</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UPA_PDA_CBO_Kauf2021</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046815969 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T15:00:11Z |
| indexdate | 2025-06-17T10:00:53Z |
| institution | BVB |
| isbn | 9781108869041 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032224438 |
| oclc_num | 1190911241 |
| open_access_boolean | |
| owner | DE-12 DE-739 DE-92 DE-91G DE-BY-TUM DE-29 |
| owner_facet | DE-12 DE-739 DE-92 DE-91G DE-BY-TUM DE-29 |
| physical | 1 Online-Ressource (xvi, 437 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO TUM_Einzelkauf ZDB-20-CBO UER_PDA_CBO_Kauf_2025 ZDB-20-CBO UPA_PDA_CBO_Kauf2021 |
| publishDate | 2020 |
| publishDateSearch | 2020 |
| publishDateSort | 2020 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Bird, Richard 1943- (DE-588)123092213 aut Algorithm design with Haskell Richard Bird, Jeremy Gibbons Cambridge Cambridge University Press 2020 1 Online-Ressource (xvi, 437 Seiten) txt rdacontent c rdamedia cr rdacarrier 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 Computer algorithms Functional programming (Computer science) Haskell (Computer program language) HASKELL (DE-588)4318275-6 gnd rswk-swf Funktionale Programmierung (DE-588)4198740-8 gnd rswk-swf HASKELL (DE-588)4318275-6 s Funktionale Programmierung (DE-588)4198740-8 s DE-604 Gibbons, Jeremy 1966- (DE-588)1047093731 aut Erscheint auch als Druck-Ausgabe, Hardcover 978-1-108-49161-7 https://doi.org/10.1017/9781108869041 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Bird, Richard 1943- Gibbons, Jeremy 1966- Algorithm design with Haskell Computer algorithms Functional programming (Computer science) Haskell (Computer program language) HASKELL (DE-588)4318275-6 gnd Funktionale Programmierung (DE-588)4198740-8 gnd |
| subject_GND | (DE-588)4318275-6 (DE-588)4198740-8 |
| title | Algorithm design with Haskell |
| title_auth | Algorithm design with Haskell |
| title_exact_search | Algorithm design with Haskell |
| title_exact_search_txtP | 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 |
| topic | Computer algorithms Functional programming (Computer science) Haskell (Computer program language) HASKELL (DE-588)4318275-6 gnd Funktionale Programmierung (DE-588)4198740-8 gnd |
| topic_facet | Computer algorithms Functional programming (Computer science) Haskell (Computer program language) HASKELL Funktionale Programmierung |
| url | https://doi.org/10.1017/9781108869041 |
| work_keys_str_mv | AT birdrichard algorithmdesignwithhaskell AT gibbonsjeremy algorithmdesignwithhaskell |