| | Binary Trees to Hash Array Mapped Tries, Step by Step (vaibhavsagar.com) |
|
2 points by todsacerdoti 9 months ago | past
|
| | Popcount CPU instruction (2019) (vaibhavsagar.com) |
|
230 points by softwaredoug 11 months ago | past | 99 comments
|
| | The NSA Instruction (2019) (vaibhavsagar.com) |
|
244 points by cjg on June 11, 2021 | past | 86 comments
|
| | The NSA Instruction (2019) (vaibhavsagar.com) |
|
1 point by lukeh on June 1, 2021 | past
|
| | Popcount CPU instruction (vaibhavsagar.com) |
|
350 points by mmastrac on Sept 9, 2019 | past | 162 comments
|
| | Refactoring Haskell: A Case Study (vaibhavsagar.com) |
|
2 points by bibyte on March 12, 2019 | past
|
| | IHaskell on CoCalc (vaibhavsagar.com) |
|
4 points by alex_hirner on Aug 31, 2018 | past
|
| | IHaskell on CoCalc (vaibhavsagar.com) |
|
4 points by williamstein on April 9, 2018 | past
|
| | Revisiting 'Monadic Parsing in Haskell' (vaibhavsagar.com) |
|
116 points by signa11 on Feb 4, 2018 | past | 10 comments
|
| | Building Static Haskell Binaries with Nix (vaibhavsagar.com) |
|
1 point by setra on Jan 3, 2018 | past
|
| | Monad Anti-tutorial (vaibhavsagar.com) |
|
1 point by sridca on Aug 13, 2017 | past
|
| | I Haskell a Git (vaibhavsagar.com) |
|
2 points by vaibhavsagar on Aug 13, 2017 | past
|
| | An All-in-One DAG Toolkit: The strongly-connected components algorithm (vaibhavsagar.com) |
|
71 points by how-about-this on June 10, 2017 | past | 3 comments
|
| | Monad Anti-tutorial (vaibhavsagar.com) |
|
3 points by luu on June 1, 2017 | past
|
| | Discovering Continuations with Typed Holes (vaibhavsagar.com) |
|
2 points by luu on May 31, 2017 | past
|
| | Imperative Haskell (vaibhavsagar.com) |
|
149 points by rutenspitz on May 30, 2017 | past | 69 comments
|