Cargando…
Purely functional data structures /
"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 languag...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge, U.K. ; New York :
Cambridge University Press,
1998.
|
| Temas: | |
| Acceso en línea: | Texto completo |
| Sumario: | "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 |
|---|---|
| Descripción Física: | 1 online resource (x, 220 pages) : illustrations |
| Bibliografía: | Includes bibliographical references and index. |
| ISBN: | 9781139811743 1139811746 9780511530104 0511530102 0511825137 9780511825132 9781283870801 1283870800 |