samth / Persistent Array
Programming Languages
racket
414 projects
Semi-persistent arrays
Implemented by Jason Hemann and Dan Friedman.
Based on a design by Sylvain Conchon and Jean-Christophe Filliâtre.
See A Persistent Union-Find Data Structure. In ACM SIGPLAN Workshop on ML, pages 37-45, Freiburg, Germany, October 2007.
This implementation extends the paper by allowing the array to be expanded.
Note that the project description data, including the texts, logos, images, and/or trademarks,
for each open source project belongs to its rightful owner.
If you wish to add or remove any projects, please contact us at [email protected].