Purely Functional Algorithms and Data Structures in Scala
-
Updated
Aug 14, 2023 - Scala
Purely Functional Algorithms and Data Structures in Scala
Scala implementation of data structures from Chris Okasaki's book
Purely functional data structures in Java
Contains realisations of common-used math functions and classical algorithms, written in Scala's pure-functional style.
A Type-Level Encoding of Natural Numbers as a Linked List of Bits
My notes and solutions for "Purely Functional Data Structures" book by Chris Okasaki (in OCaml).
Solutions to Okasaki's "Purely Functional Data Structures":
Data structures and exercises from 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 C#
Exercises for 'Purely Functional Data Structures' by Okasaki (in reasonml)
Web visualization of the simple catenable deque (sec 11.2) of Okasaki book
An Elixir implementation of Okasaki's 1995 paper
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."