Julian Sutherland's repositories
TreeCounter
A wait-free tree counter. Creates a binary tree of counters, with each leaf associated with a thread. Leaves can be split, creating a new leaf for the current thread and another that can be used by another thread. Each thread will act on different leaves, meaning the actions are wait-free. A read is performed on the counter by recursively traversing it and summing the value of the counters in the nodes and leaves of the tree.
Treiber-Stack
Treiber Stack implemented in Haskell
Allegro-Monad
Allegro Monad
balancer-v2-monorepo
Balancer V2 Monorepo
bucharest-lean-ac
Content for Bucharest Autumn School
Classical-Shor-s
Classical Shor's
dmenu_run--
configurable dmenu_run
dotfiles-2.0
XMonad™️. Widgets go brr.
haskell-mode
Emacs mode for Haskell
lean-sqrt-2-irrational
A proof that the square root of 2 is irrational in Lean 3
Nature--code4good-
Nature (code4good)
SafeHash
thread safe hashtable
SpinCounter
A simple lock-free spin counter written in haskell