컨텐츠로 이동
Purely functional data structures 해당 항목을 미리보기
닫기해당 항목을 미리보기
확인중입니다…

Purely functional data structures

저자: Chris Okasaki
출판사: Cambridge, U.K. ; New York : Cambridge University Press, 1998.
판/형식:   도서 : 영어모든 판과 형식 보기
데이터베이스:WorldCat
요약:
"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  더 읽기…
평가:

(아무런 평가가 없습니다.) 0 리뷰와 함께 - 첫번째로 올려주세요.

주제
다음과 같습니다:

 

도서관에서 사본 찾기

&AllPage.SpinnerRetrieving; 해당항목을 보유하고 있는 도서관을 찾는 중

상세정보

자료 유형: 인터넷 자료
문서 형식: 책, 인터넷 자원
모든 저자 / 참여자: Chris Okasaki
ISBN: 0521631246 9780521631242 0521663504 9780521663502
OCLC 번호: 38521530
설명: x, 220 pages : illustrations ; 24 cm
내용: 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.
책임: Chris Okasaki.
더 많은 정보:

초록:

This book describes data structures and data structure design techniques for functional languages.  더 읽기…

리뷰

편집자의 리뷰

출판사 줄거리

"This book is important because it presents data structures from the point of view of functional languages...a handy reference for professional functional programmers...Most of the programs can 더 읽기…

 
사용자-기여 리뷰
GoodReads 리뷰 가져오는 중…
DOGObooks 리뷰를 가지고 오는 중…

태그

첫번째 되기
요청하신 것을 확인하기

이 항목을 이미 요청하셨을 수도 있습니다. 만약 이 요청을 계속해서 진행하시려면 Ok을 선택하세요.

링크된 데이터


<http://www.worldcat.org/oclc/38521530>
library:oclcnum"38521530"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:MediaObject
rdf:typeschema:Book
schema:about
schema:about
<http://id.worldcat.org/fast/936087>
rdf:typeschema:Intangible
schema:name"Langages de programmation fonctionnelle."@en
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:creator
schema:datePublished"1998"
schema:description"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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/559048>
schema:inLanguage"en"
schema:name"Purely functional data structures"@en
schema:publication
schema:publisher
schema:reviews
rdf:typeschema:Review
schema:itemReviewed<http://www.worldcat.org/oclc/38521530>
schema:reviewBody""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."
schema:workExample
schema:workExample
umbel:isLike<http://bnb.data.bl.uk/id/resource/GBA058006>
wdrs:describedby

Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.