¶Reading log
2023-07-18
Added [Gila2023], which presents “zip-zip trees”, which claim to offer the balanced depth of a treap or binary search tree that has been constructed with uniform random insertions, while being strongly history independent.
Added [Sulzmann2023], which shows how to model certain features of Go using dictionary-passing. (That's what the implementation does under the covers for interface types; it will be interesting to see how this proposed formalism lines up with the implementation.)