John Napier

Currently both `StrictStack` and `StrictQueue` use an amortized `O(1)` time cost and `O(1)` space cost for their sizes. If `StrictStack` could gain an `O(1)` time/space complexity, and if `StrictQueue` delegated...

Dependent on `Diet` (#9)

`LazyList`s, lists with lazy, memoized tail's, are generally useful and specifically useful as the backbone for RTDs.

min/max heaps seem like a reasonable next addition. Okasaki's binomial heap should translate nicely.