Understanding Zippers: Efficient Data Structure Updates in Functional Programming
In the Haskell stuff, I was planning on moving on to some monad-related stuff. But I had a reader write in, and ask me to write another post on data structures, focusing on a structured called a zi…
Read the full articleYou might also wanna read
Building Faster Parsers Through Data-Oriented Design: Flat Arrays Over Pointer Trees
How designing the data structure first (flat arrays of indices instead of a pointer tree) makes a parser fast and collapses memory layout, a
arshad.fyi·18d ago
It took 40 years for technology to catch up to this zipper design
An old patent from MIT Professor Bill Freeman inspired the new “Y-zipper,” a three-sided fastener that snaps gear, robots, and art into shap
picower.mit.edu·2mo ago
Paper on a Data Structure for Searching and Updating Large-Scale String Data While Compressed Accepted to ESA2026
A paper by Research Scientist Takaaki Nishimoto and Team Director Yasuo Tabei of the Compressed Information Processing Team at the RIKEN Cen
aip.riken.jp·8d ago
Comments
Sign in to join the conversation.
No comments yet. Be the first.