FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Purely Functional Data Structures

Purely Functional Data Structures

Chris Okasaki
    Product form
      FORMAT: Paperback / softback

      R 2,470.44 Price and availability exclusive to website

      YOU COULD EARN 2,470.44 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 411.74 per month!
      3x monthly payments of R 823.48 with
      4x fortnightly payments of R 617.61 with

      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.

      Format: Paperback / softback CONTRIBUTORS: Chris Okasaki EAN: 9780521663502 COUNTRY: United Kingdom PAGES: 232 WEIGHT: 350 g HEIGHT: 227 mm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 1999-06-13 CITY: GENRE: COMPUTERS / Programming / Algorithms WIDTH: 153 mm SPINE:

      Book Themes:

      Algorithms and data structures

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      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.

      Format: Paperback / softback CONTRIBUTORS: Chris Okasaki EAN: 9780521663502 COUNTRY: United Kingdom PAGES: 232 WEIGHT: 350 g HEIGHT: 227 mm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 1999-06-13 CITY: GENRE: COMPUTERS / Programming / Algorithms WIDTH: 153 mm SPINE:

      Book Themes:

      Algorithms and data structures

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account