LibreTech
  • Home
  • About
  • Author
  • Git
  • Gemini
Purely Functional Data Structure: Finite Map
Subscribe
Data Structure

Purely Functional Data Structure: Finite Map

  • Guillaume Salvan

    gs@libretech.eu

    More posts by Guillaume Salvan.

Guillaume Salvan

24 Aug 2020 • 2 min read

This post is for paying subscribers only

Subscribe now

Already have an account? Sign in

Subscribe to LibreTech

Get the latest posts delivered right to your inbox

Great! Check your inbox and click the link to confirm your subscription.
Please enter a valid email address!

More in Data Structure

See all 11 posts →
Data Structure

Purely Functional Data Structure: Sortable

Sortable {-# LANGUAGE MultiParamTypeClasses #-} module Sortable where class (Ord a) => Sortable s a where empty :: s a add :: a -> s a -> s a sort :: s a -> [a] open Ordered module type Sortable = sig module Elem : Ordered type sortable val empty
  • Guillaume Salvan
Guillaume Salvan 26 Aug 2020 • 2 min read
Data Structure

Purely Functional Data Structure: Binary

Binary Dense The representation of a positional number system is dense when represented as a sequence of digit including 0. module BinaryNumberDense where data Digit = Zero | One type Nat = [Digit] inc :: Nat -> Nat inc [] = [One] inc (Zero:xs) = One : xs inc (One:xs)
  • Guillaume Salvan
Guillaume Salvan 21 Aug 2020 • 2 min read
LibreTech © 2021
Latest Posts Ghost
You've successfully subscribed to LibreTech!
Could not sign up! Invalid sign up link.

Subscribe to LibreTech

Stay up to date! Get all the latest & greatest posts delivered straight to your inbox

Great! Check your inbox and click the link to confirm your subscription.
Please enter a valid email address!