The C Programming Language
by Brian W. Kernighan |
Code Complete
by Steve McConnell |
Refactoring
by Martin Fowler | 
Effective Java
by Joshua Bloch | 
Mastering Regular Expressions
by Jeffrey E. F. Friedl | 
JavaScript: The Good Parts
by Douglas Crockford | 
Java Concurrency in Practice
by Brian Goetz | 
The Clean Coder
by Robert C. Martin |
Practical Vim
by Drew Neil | 
Working Effectively with Legacy Code
by Michael Feathers |
The UNIX Programming Environment
by Brian W. Kernighan |
Domain-Driven Design
by Eric Evans | 
Practical Common Lisp
by Peter Seibel |
Learn You a Haskell for Great Good!
by Miran Lipovaca |
The Design and Evolution of C++
by Bjarne Stroustrup |
The Algorithm Design Manual
by Steven S. Skiena | 
JavaScript Patterns
by Stoyan Stefanov |
High Performance MySQL
by Jeremy D. Zawodny | 
Modern C++ Design
by Andrei Alexandrescu |
Perl Cookbook
by Tom Christiansen |
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.