Purely functional data structures:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, U.K.
Cambridge University Press
1998
|
| Schlagworte: | |
| Online-Zugang: | FAW01 FAW02 Volltext |
| Beschreibung: | Includes bibliographical references and index "Most books on data structures assume an imperative language like C or C++. However, data structures for these languages do not always translate well to functional languages such as Standard ML, Haskell, or Scheme. This book describes data structures from the point of view of functional languages, with examples, and presents design techniques so that programmers can develop their own functional data structures. It includes both classical data structures, such as red-black trees and binomial queues, and a host of new data structures developed exclusively for functional languages. All source code is given in Standard ML and Haskell, and most of the programs can easily be adapted to other functional languages." "This handy reference for professional programmers working with functional languages can also be used as a tutorial or for self-study."--Jacket Introduction -- Persistence -- Some familiar data structures in a functional setting -- Lazy evaluation -- Fundamentals of amortization -- Amortization and persistence via lazy evaluation -- Eliminating amortization -- Lazy rebuilding -- Numerical representations -- Data-structural bootstrapping -- Implicit recursive slowdown -- Appendix: Haskell source code |
| Beschreibung: | 1 Online-Ressource (x, 220 p.) |
| ISBN: | 0511530102 0511825137 0521631246 0521663504 1139811746 9780511530104 9780511825132 9780521631242 9780521663502 9781139811743 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043138378 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 151126s1998 |||| o||u| ||||||eng d | ||
| 020 | |a 0511530102 |c electronic bk. |9 0-511-53010-2 | ||
| 020 | |a 0511825137 |9 0-511-82513-7 | ||
| 020 | |a 0521631246 |9 0-521-63124-6 | ||
| 020 | |a 0521663504 |9 0-521-66350-4 | ||
| 020 | |a 1139811746 |c electronic bk. |9 1-139-81174-6 | ||
| 020 | |a 9780511530104 |c electronic bk. |9 978-0-511-53010-4 | ||
| 020 | |a 9780511825132 |9 978-0-511-82513-2 | ||
| 020 | |a 9780511825132 |9 978-0-511-82513-2 | ||
| 020 | |a 9780521631242 |9 978-0-521-63124-2 | ||
| 020 | |a 9780521663502 |9 978-0-521-66350-2 | ||
| 020 | |a 9781139811743 |c electronic bk. |9 978-1-139-81174-3 | ||
| 035 | |a (OCoLC)822565696 | ||
| 035 | |a (DE-599)BVBBV043138378 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 |a DE-1047 | ||
| 082 | 0 | |a 005.7/3 |2 22 | |
| 100 | 1 | |a Okasaki, Chris |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Purely functional data structures |c Chris Okasaki |
| 264 | 1 | |a Cambridge, U.K. |b Cambridge University Press |c 1998 | |
| 300 | |a 1 Online-Ressource (x, 220 p.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index | ||
| 500 | |a "Most books on data structures assume an imperative language like C or C++. However, data structures for these languages do not always translate well to functional languages such as Standard ML, Haskell, or Scheme. This book describes data structures from the point of view of functional languages, with examples, and presents design techniques so that programmers can develop their own functional data structures. It includes both classical data structures, such as red-black trees and binomial queues, and a host of new data structures developed exclusively for functional languages. All source code is given in Standard ML and Haskell, and most of the programs can easily be adapted to other functional languages." "This handy reference for professional programmers working with functional languages can also be used as a tutorial or for self-study."--Jacket | ||
| 500 | |a Introduction -- Persistence -- Some familiar data structures in a functional setting -- Lazy evaluation -- Fundamentals of amortization -- Amortization and persistence via lazy evaluation -- Eliminating amortization -- Lazy rebuilding -- Numerical representations -- Data-structural bootstrapping -- Implicit recursive slowdown -- Appendix: Haskell source code | ||
| 650 | 7 | |a Datastructuren |2 gtt | |
| 650 | 7 | |a Functionele programmering |2 gtt | |
| 650 | 7 | |a Structures de données (informatique) |2 ram | |
| 650 | 7 | |a Langages de programmation fonctionnelle |2 ram | |
| 650 | 7 | |a Standard ML. |2 swd | |
| 650 | 7 | |a Datenstruktur |2 swd | |
| 650 | 7 | |a Funktionale Programmiersprache |2 swd | |
| 650 | 7 | |a COMPUTERS / Data Processing |2 bisacsh | |
| 650 | 7 | |a Data structures (Computer science) |2 local | |
| 650 | 7 | |a Functional programming languages |2 local | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Functional programming languages | |
| 650 | 0 | 7 | |a Standard ML |0 (DE-588)4295302-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenstruktur |0 (DE-588)4011146-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Funktionale Programmiersprache |0 (DE-588)4129948-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
| 689 | 0 | 1 | |a Funktionale Programmiersprache |0 (DE-588)4129948-6 |D s |
| 689 | 0 | 2 | |a Standard ML |0 (DE-588)4295302-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=502386 |x Aggregator |3 Volltext |
| 912 | |a ZDB-4-EBA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028562569 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=502386 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=502386 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804175584885997568 |
|---|---|
| any_adam_object | |
| author | Okasaki, Chris |
| author_facet | Okasaki, Chris |
| author_role | aut |
| author_sort | Okasaki, Chris |
| author_variant | c o co |
| building | Verbundindex |
| bvnumber | BV043138378 |
| collection | ZDB-4-EBA |
| ctrlnum | (OCoLC)822565696 (DE-599)BVBBV043138378 |
| dewey-full | 005.7/3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.7/3 |
| dewey-search | 005.7/3 |
| dewey-sort | 15.7 13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04174nmm a2200709zc 4500</leader><controlfield tag="001">BV043138378</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151126s1998 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511530102</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">0-511-53010-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511825137</subfield><subfield code="9">0-511-82513-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521631246</subfield><subfield code="9">0-521-63124-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521663504</subfield><subfield code="9">0-521-66350-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139811746</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-139-81174-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511530104</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-0-511-53010-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511825132</subfield><subfield code="9">978-0-511-82513-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511825132</subfield><subfield code="9">978-0-511-82513-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521631242</subfield><subfield code="9">978-0-521-63124-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521663502</subfield><subfield code="9">978-0-521-66350-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139811743</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-139-81174-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)822565696</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043138378</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.7/3</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Okasaki, Chris</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Purely functional data structures</subfield><subfield code="c">Chris Okasaki</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, U.K.</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (x, 220 p.)</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="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">"Most books on data structures assume an imperative language like C or C++. However, data structures for these languages do not always translate well to functional languages such as Standard ML, Haskell, or Scheme. This book describes data structures from the point of view of functional languages, with examples, and presents design techniques so that programmers can develop their own functional data structures. It includes both classical data structures, such as red-black trees and binomial queues, and a host of new data structures developed exclusively for functional languages. All source code is given in Standard ML and Haskell, and most of the programs can easily be adapted to other functional languages." "This handy reference for professional programmers working with functional languages can also be used as a tutorial or for self-study."--Jacket</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Introduction -- Persistence -- Some familiar data structures in a functional setting -- Lazy evaluation -- Fundamentals of amortization -- Amortization and persistence via lazy evaluation -- Eliminating amortization -- Lazy rebuilding -- Numerical representations -- Data-structural bootstrapping -- Implicit recursive slowdown -- Appendix: Haskell source code</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Datastructuren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Functionele programmering</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Structures de données (informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Langages de programmation fonctionnelle</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Standard ML.</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Funktionale Programmiersprache</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Data Processing</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data structures (Computer science)</subfield><subfield code="2">local</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Functional programming languages</subfield><subfield code="2">local</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functional programming languages</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Standard ML</subfield><subfield code="0">(DE-588)4295302-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Funktionale Programmiersprache</subfield><subfield code="0">(DE-588)4129948-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Funktionale Programmiersprache</subfield><subfield code="0">(DE-588)4129948-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Standard ML</subfield><subfield code="0">(DE-588)4295302-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=502386</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028562569</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=502386</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=502386</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043138378 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:18:37Z |
| institution | BVB |
| isbn | 0511530102 0511825137 0521631246 0521663504 1139811746 9780511530104 9780511825132 9780521631242 9780521663502 9781139811743 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028562569 |
| oclc_num | 822565696 |
| open_access_boolean | |
| owner | DE-1046 DE-1047 |
| owner_facet | DE-1046 DE-1047 |
| physical | 1 Online-Ressource (x, 220 p.) |
| psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Okasaki, Chris Verfasser aut Purely functional data structures Chris Okasaki Cambridge, U.K. Cambridge University Press 1998 1 Online-Ressource (x, 220 p.) txt rdacontent c rdamedia cr rdacarrier Includes bibliographical references and index "Most books on data structures assume an imperative language like C or C++. However, data structures for these languages do not always translate well to functional languages such as Standard ML, Haskell, or Scheme. This book describes data structures from the point of view of functional languages, with examples, and presents design techniques so that programmers can develop their own functional data structures. It includes both classical data structures, such as red-black trees and binomial queues, and a host of new data structures developed exclusively for functional languages. All source code is given in Standard ML and Haskell, and most of the programs can easily be adapted to other functional languages." "This handy reference for professional programmers working with functional languages can also be used as a tutorial or for self-study."--Jacket Introduction -- Persistence -- Some familiar data structures in a functional setting -- Lazy evaluation -- Fundamentals of amortization -- Amortization and persistence via lazy evaluation -- Eliminating amortization -- Lazy rebuilding -- Numerical representations -- Data-structural bootstrapping -- Implicit recursive slowdown -- Appendix: Haskell source code Datastructuren gtt Functionele programmering gtt Structures de données (informatique) ram Langages de programmation fonctionnelle ram Standard ML. swd Datenstruktur swd Funktionale Programmiersprache swd COMPUTERS / Data Processing bisacsh Data structures (Computer science) local Functional programming languages local Data structures (Computer science) Functional programming languages Standard ML (DE-588)4295302-9 gnd rswk-swf Datenstruktur (DE-588)4011146-5 gnd rswk-swf Funktionale Programmiersprache (DE-588)4129948-6 gnd rswk-swf Datenstruktur (DE-588)4011146-5 s Funktionale Programmiersprache (DE-588)4129948-6 s Standard ML (DE-588)4295302-9 s 1\p DE-604 http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=502386 Aggregator Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Okasaki, Chris Purely functional data structures Datastructuren gtt Functionele programmering gtt Structures de données (informatique) ram Langages de programmation fonctionnelle ram Standard ML. swd Datenstruktur swd Funktionale Programmiersprache swd COMPUTERS / Data Processing bisacsh Data structures (Computer science) local Functional programming languages local Data structures (Computer science) Functional programming languages Standard ML (DE-588)4295302-9 gnd Datenstruktur (DE-588)4011146-5 gnd Funktionale Programmiersprache (DE-588)4129948-6 gnd |
| subject_GND | (DE-588)4295302-9 (DE-588)4011146-5 (DE-588)4129948-6 |
| title | Purely functional data structures |
| title_auth | Purely functional data structures |
| title_exact_search | Purely functional data structures |
| title_full | Purely functional data structures Chris Okasaki |
| title_fullStr | Purely functional data structures Chris Okasaki |
| title_full_unstemmed | Purely functional data structures Chris Okasaki |
| title_short | Purely functional data structures |
| title_sort | purely functional data structures |
| topic | Datastructuren gtt Functionele programmering gtt Structures de données (informatique) ram Langages de programmation fonctionnelle ram Standard ML. swd Datenstruktur swd Funktionale Programmiersprache swd COMPUTERS / Data Processing bisacsh Data structures (Computer science) local Functional programming languages local Data structures (Computer science) Functional programming languages Standard ML (DE-588)4295302-9 gnd Datenstruktur (DE-588)4011146-5 gnd Funktionale Programmiersprache (DE-588)4129948-6 gnd |
| topic_facet | Datastructuren Functionele programmering Structures de données (informatique) Langages de programmation fonctionnelle Standard ML. Datenstruktur Funktionale Programmiersprache COMPUTERS / Data Processing Data structures (Computer science) Functional programming languages Standard ML |
| url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=502386 |
| work_keys_str_mv | AT okasakichris purelyfunctionaldatastructures |