Data structures and exercises from Okasaki's Purely Functional Data Structures
-
Updated
Jun 3, 2016 - OCaml
Data structures and exercises from Okasaki's Purely Functional Data Structures
A Type-Level Encoding of Natural Numbers as a Linked List of Bits
An Elixir implementation of Okasaki's 1995 paper
Exercises for 'Purely Functional Data Structures' by Okasaki (in reasonml)
Contains realisations of common-used math functions and classical algorithms, written in Scala's pure-functional style.
Web visualization of the simple catenable deque (sec 11.2) of Okasaki book
Scala implementation of data structures from Chris Okasaki's book
Solutions to Okasaki's "Purely Functional Data Structures":
My notes and solutions for "Purely Functional Data Structures" book by Chris Okasaki (in Haskell).
Purely functional data structures in Java
Purely Functional Algorithms and Data Structures in Scala
My notes and solutions for "Purely Functional Data Structures" book by Chris Okasaki (in OCaml).
Purely Functional Data Structures in C#
Add a description, image, and links to the okasaki topic page so that developers can more easily learn about it.
To associate your repository with the okasaki topic, visit your repo's landing page and select "manage topics."