Implementation of data structures in OCaml
OCaml Makefile Standard ML
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
bottom_up_merge_sort
catenable_deque
deque
heap
queue
random_access_list
red_black_tree
splay_tree
stream
trie
README.md

README.md

Data Structures in OCaml

This project contains implementations of a few data structures in OCaml. Most of them are from the amazing Purely Functional Data Structures by Chris Okasaki.

The book describes several implementations of common data structures (lists, queues, heaps) as examples to concepts and techniques to work with persistent data structures in a purely functional paradigm.

The implementations are in Standard ML, so converting to OCaml is trivial. I'm just doing this for learning purposes.