Lazy Contract Checking for Immutable Data Structures
Implementation and Application of Functional Languages
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Lazy functional incremental parsing
Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Super-efficient aggregating history-independent persistent authenticated dictionaries
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
The performance of the Haskell containers package
Proceedings of the third ACM Haskell symposium on Haskell
Program verification through characteristic formulae
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
The essence of monotonic state
Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
Consistent and durable data structures for non-volatile byte-addressable memory
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
Authenticated Dictionaries: Real-World Costs and Trade-Offs
ACM Transactions on Information and System Security (TISSEC)
Worlds: controlling the scope of side effects
Proceedings of the 25th European conference on Object-oriented programming
Characteristic formulae for the verification of imperative programs
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Concurrent tries with efficient non-blocking snapshots
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Research paper: The saga of minimum spanning trees
Computer Science Review
Proceedings of the 8th symposium on Dynamic languages
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Extensible sparse functional arrays with circuit parallelism
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Synthesis modulo recursive functions
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Proceedings of the 12th international conference on Generative programming: concepts & experiences
Dagstuhl seminar review: consistency in distributed systems
ACM SIGACT News
Hi-index | 0.00 |
From the Publisher: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.