purely functional data structures von okasaki chris (57 Ergebnisse)

Paperback. Zustand: Good. No Jacket. Former library book; Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 0.78.

Zustand: Good. Ships from the UK. Used book that is in clean, average condition without any missing pages.

Zustand: good. Book is considered to be in good or better condition. The actual cover image may not match the stock photo. Hard cover books may show signs of wear on the spine, cover or dust jacket. Paperback book may show signs of wear on spine or cover as well as having a slight bend, curve or creasing to it. Book should have minimal to no writing inside and no highlighting. Pages should be free of tears or creasing. Stickers should not be present on cover or elsewhere, and any CD or DVD expected with the book is included. Book is not a former library copy.

Zustand: as new. Appears unread. May have a retail sticker on back cover or remainder mark on the text block.

Zustand: NEW.

paperback. Zustand: New. Ship within 24hrs. 100% Satisfaction is Our #1 Goal!

Zustand: New. In.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Zustand: New. Most books on data structures assume an imperative language. However, their data structures do not translate well to functional languages. This book describes data structures and data structure design techniques from the point of view of functional language.

Zustand: New. 1999. Paperback. This book describes data structures and data structure design techniques for functional languages. Num Pages: 232 pages, Illustrations. BIC Classification: UMB. Category: (P) Professional & Vocational. Dimension: 229 x 155 x 15. Weight in Grams: 360. 232 pages, Illustrations. This book describes data structures and data structure design techniques for functional languages. Cateogry: (P) Professional & Vocational. BIC Classification: UMB. Dimension: 229 x 155 x 15. Weight: 368. . . . . .

Zustand: New.

Zustand: New.

Zustand: New. pp. 232.

Zustand: New.

Zustand: New. SUPER FAST SHIPPING.

Zustand: As New. Unread book in perfect condition.

Paperback. Zustand: New. 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.

Paperback. Zustand: New. 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.

paperback. Zustand: Very Good. Paperback--excellent condition.

Paperback. Zustand: New. 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.

Zustand: As New. Unread book in perfect condition.

Zustand: New. 1999. Paperback. This book describes data structures and data structure design techniques for functional languages. Num Pages: 232 pages, Illustrations. BIC Classification: UMB. Category: (P) Professional & Vocational. Dimension: 229 x 155 x 15. Weight in Grams: 360. 232 pages, Illustrations. This book describes data structures and data structure design techniques for functional languages. Cateogry: (P) Professional & Vocational. BIC Classification: UMB. Dimension: 229 x 155 x 15. Weight: 368. . . . . . Books ship from the US and Ireland.

Paperback. Zustand: New. 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.

Paperback. Zustand: new. Paperback. 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. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Paperback. Zustand: new. Paperback. 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. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Paperback. Zustand: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority!

paperback. Zustand: New. In shrink wrap. Looks like an interesting title!

Zustand: New.

Paperback. Zustand: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.

Paperback. Zustand: new. Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.