|
||||||||||||||||||||
|
||||||||||||||||||||
|
||||||||||||||||||||
よく一緒に購入されている商品
商品の説明
内容説明
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.
Book Description
Most books on data structures assume an imperative language such as 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 that allow programmers to develop their own functional data structures. The author 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 are easily adaptable 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.
登録情報
|
この本のなか見！検索より
（詳細はこちら）
書き出し
A distinctive property of functional data structures is that they are always persistent-updating a functional data structure does not destroy the existing version, but rather creates a new version that coexists with the old one. 最初のページを読む
おもて表紙 | 著作権 | 目次 | 抜粋 | 索引 | 裏表紙
A distinctive property of functional data structures is that they are always persistent-updating a functional data structure does not destroy the existing version, but rather creates a new version that coexists with the old one. 最初のページを読む
その他の機能
頻出単語一覧
この本のサンプルページを閲覧する
頻出単語一覧
おもて表紙 | 著作権 | 目次 | 抜粋 | 索引 | 裏表紙
この商品を見た後に買っているのは？
カスタマーレビュー
最も参考になったカスタマーレビュー
24 人中、23人の方が、｢このレビューが参考になった｣と投票しています。
形式:ペーパーバック
関数プログラミング向けのデータ構造というものについて、考えたことがあるでしょうか？
良くアルゴリズム本に出てくるデータ構造は、破壊的更新を使った命令的（手続き的）なスタイルで使われることを前提に定義されています。そのためデータ構造の中には、Standard ML（SML）や Haskell などのような関数型言語で使おうとすると（非常に）効率が悪いものもあります。
本書ではならし解析や遅延評価を用い、「どうしたらより効率の良いデータ構造が構築できるか」についてせまっていきます。
本書は実は Haskell ではなく SML を対象として書かれているのですが、Haskell をやっていく中でもその重要度が劣ることはありません。寧ろ、Haskell 的にはその価値が増すかもしれません。破壊的更新を一切行わず、代わりに遅延評価を用いるという方針は、Haskell にこそ向いたものです。実際、GHC や Hugs などの Haskell の処理系に付属するライブラリには、Data.Queue や Data.Sequence など、本書で述べられているテクニックやその発展を使っているものもあります。
また、SML のような本来遅延評価ではない言語に遅延評価を差し込んでいくという形で議論が展開されていくため、遅延評価って何が良いのかよくわからない人は本書を読むことで遅延評価というものの価値を知ることができるでしょう。
本書のソースコードは SML を使って書かれていますが、巻末に Haskell でのコードが載っているので、巻末のコードと照らし合わせながら読めば Haskell しか知らない人であっても分からないということはないと思います。
ただ、一点注意しておかなればならないのは、本書はその性格上アルゴリズムの知識を前提とすることです。他にアルゴリズム本を読んだことがなければ、先に何か適当な本を読んでおくと良いでしょう。Algorithms: A Functional Programming Approach という Haskell を使ったアルゴリズム本があるので、Haskell をやっている人であれば先にこれを読んでおくと良いかもしれません。
良くアルゴリズム本に出てくるデータ構造は、破壊的更新を使った命令的（手続き的）なスタイルで使われることを前提に定義されています。そのためデータ構造の中には、Standard ML（SML）や Haskell などのような関数型言語で使おうとすると（非常に）効率が悪いものもあります。
本書ではならし解析や遅延評価を用い、「どうしたらより効率の良いデータ構造が構築できるか」についてせまっていきます。
本書は実は Haskell ではなく SML を対象として書かれているのですが、Haskell をやっていく中でもその重要度が劣ることはありません。寧ろ、Haskell 的にはその価値が増すかもしれません。破壊的更新を一切行わず、代わりに遅延評価を用いるという方針は、Haskell にこそ向いたものです。実際、GHC や Hugs などの Haskell の処理系に付属するライブラリには、Data.Queue や Data.Sequence など、本書で述べられているテクニックやその発展を使っているものもあります。
また、SML のような本来遅延評価ではない言語に遅延評価を差し込んでいくという形で議論が展開されていくため、遅延評価って何が良いのかよくわからない人は本書を読むことで遅延評価というものの価値を知ることができるでしょう。
本書のソースコードは SML を使って書かれていますが、巻末に Haskell でのコードが載っているので、巻末のコードと照らし合わせながら読めば Haskell しか知らない人であっても分からないということはないと思います。
ただ、一点注意しておかなればならないのは、本書はその性格上アルゴリズムの知識を前提とすることです。他にアルゴリズム本を読んだことがなければ、先に何か適当な本を読んでおくと良いでしょう。Algorithms: A Functional Programming Approach という Haskell を使ったアルゴリズム本があるので、Haskell をやっている人であれば先にこれを読んでおくと良いかもしれません。
Amazon.com で最も参考になったカスタマーレビュー (beta)
Amazon.com:
10件のカスタマーレビュー
103 人中、102人の方が、｢このレビューが参考になった｣と投票しています。
An elegant book
2005/3/31
形式:ペーパーバック
Okasaki's slim volume is one of the best expositions on implementing data structures & algorithms in a functional language. After taking an introductory course on functional programming, this would be the book which tells you where to go next.
This book doesn't just present a rehash/rewrite of imperative data structures, only written in a functional language. Instead, Okasaki makes sure to emphasize benefits which only functional programming can bring to the table. For example, many functional data structures can compactly represent not just their current state, but all of their past states as well--a feature called "Persistence". Also, functional newbie programmers might be wondering why lazy vs. strict programming is a big deal, and Okasaki shows clearly where data structures can benefit from either being lazy or being strict.
For the advanced reader, Okasaki also presents several powerful techniques for analyzing the runtime of algorithms, including the so-called "Banker's Method" and the "Physicist's Method" for analyzing amortized algorithms.
I hope that Okasaki comes out with a 2nd edition of this book; there is one missing piece in particular which I really wish he would have included: Although he presents an EXTREMELY lucid description of how to implement Red-Black trees in a functional language, he only presented algorithms for insertion and querying. Of course, deletion from a red-black tree is the hardest part, left here, I suppose, as an exercise to the student. If you want to supply this missing piece yourself, check out a paper by Stefan Kars, "Red-black trees with types", J. Functional Programming 11(4):425-432, July, 2001. It presents deletion routines, but you'll still want to read Okasaki's book first, for unless you're very much smarter than me you won't be able to understand Kars' paper until you read Okasaki's exposition of red black trees.
Finally, this book is not just useful for programmers in functional languages; logic programmers, using prolog or a varient, will also find this book very helpful, because most of the techniques (all of the techniques, really, with the exception perhaps of the lazy programming stuff) can be directly applied in a prolog programming setting as well.
After reading this book and implementing some of the data structures for yourself, you'll be amazed at how fast algorithms can run, even when written in a functional language!
This book doesn't just present a rehash/rewrite of imperative data structures, only written in a functional language. Instead, Okasaki makes sure to emphasize benefits which only functional programming can bring to the table. For example, many functional data structures can compactly represent not just their current state, but all of their past states as well--a feature called "Persistence". Also, functional newbie programmers might be wondering why lazy vs. strict programming is a big deal, and Okasaki shows clearly where data structures can benefit from either being lazy or being strict.
For the advanced reader, Okasaki also presents several powerful techniques for analyzing the runtime of algorithms, including the so-called "Banker's Method" and the "Physicist's Method" for analyzing amortized algorithms.
I hope that Okasaki comes out with a 2nd edition of this book; there is one missing piece in particular which I really wish he would have included: Although he presents an EXTREMELY lucid description of how to implement Red-Black trees in a functional language, he only presented algorithms for insertion and querying. Of course, deletion from a red-black tree is the hardest part, left here, I suppose, as an exercise to the student. If you want to supply this missing piece yourself, check out a paper by Stefan Kars, "Red-black trees with types", J. Functional Programming 11(4):425-432, July, 2001. It presents deletion routines, but you'll still want to read Okasaki's book first, for unless you're very much smarter than me you won't be able to understand Kars' paper until you read Okasaki's exposition of red black trees.
Finally, this book is not just useful for programmers in functional languages; logic programmers, using prolog or a varient, will also find this book very helpful, because most of the techniques (all of the techniques, really, with the exception perhaps of the lazy programming stuff) can be directly applied in a prolog programming setting as well.
After reading this book and implementing some of the data structures for yourself, you'll be amazed at how fast algorithms can run, even when written in a functional language!
47 人中、41人の方が、｢このレビューが参考になった｣と投票しています。
Strange choice of implementation languages
2006/11/7
形式:ペーパーバック
The description of the book says it includes source code in both ML and Haskell. Unfortunately, the body of the text uses ML exclusively, and the Haskell code is banished to an appendix.
I say "unfortunately", because many of the data structures used depend on lazy evaluation, which comes quite naturally to Haskell, and seems to require some sort of non-standard extension in ML.
While the content is good, I wish it would have used Haskell as the primary exposition language.
I say "unfortunately", because many of the data structures used depend on lazy evaluation, which comes quite naturally to Haskell, and seems to require some sort of non-standard extension in ML.
While the content is good, I wish it would have used Haskell as the primary exposition language.
36 人中、29人の方が、｢このレビューが参考になった｣と投票しています。
Hash Tables are included, briefly.
2001/11/24
形式:ペーパーバック
A correction to another review: Hash Tables are included, briefly.
これらのレビューは参考になりましたか？
ご意見はクチコミでお聞かせください。
リストマニア
|
|
関連商品を探す
- 洋書 > Computers & Internet > Computer Science > Software Engineering
- 洋書 > Computers & Internet > Databases
- 洋書 > Computers & Internet > Programming > Algorithms
- 洋書 > Computers & Internet > Programming > Languages & Tools
- 洋書 > Computers & Internet > Programming > Software Design, Testing & Engineering
- 洋書 > Computers & Internet > Software
- 洋書 > Special Features > all foreign books
同じキーワードの商品を探す
フィードバック
- カタログ情報、または画像について報告
- 著者からのコメント
- 出版社からのコメント
|
