Error handling or The Emperor's Old Clothes.
TLDR; This problem has been solved for 40 years but the software development industry is still very fashion-oriented. In both
Two sorts with Rust
Here are some initial thoughts on Rust in the almost two years since I last looked at it along with
Ring probabilities in F#
A few months back I took a look at Elixir. More recently I’ve been exploring F# and I&
Ring probabilities with Elixir
I’ve been hearing more about Elixir lately so I thought I’d take it for a spin.
Corporate funding for Shen
It looks like it might be coming sooner than I thought. I’m sure Shenturions everywhere will find this
Purely Functional Data Structures & Algorithms : Union-Find (Haskell)
*Updated 08-23-2012 01:04:38* Replaced the use of Data.Vector with the persistent Data.Sequence which has O(logN)
Purely Functional Data Structures & Algorithms : Union-Find
It’s been a while since I last posted in this series. Today we look at the disjoint-set data
Welcome to John McCarthy's new website.
From the website: John was a legendary computer scientist at Stanford University who developed time-sharing, invented LISP, and founded the
Quick Sort in Shen
A Shen type-checked implementation of Quick Sort is even more elegant/terse compared with the CL version posted previously. Pattern-matching
Quick Sort in Common Lisp
After watching some of Tim Roughgarden’s videos on sorting algorithms, I thought I’d post an implementation