Matthew Hammer
Matthew Hammer
One benchmark seems to handle big swap well: `List_reverse_name`. Others do not, such as `Rope_mergesort_name`. We'd like to learn lessons from the code that works to fix the code that...
- Kyle, Mike and Matthew discussed this a couple of weeks ago - Plot axis: #Interactions on X vs Cumulative Time on Y - Plot lines: From-scratch versus Incremental (Nominal...
- Collect and report performance numbers for `_sac` versions, as we have already done for `_arggen` and `_name` - I don't know what to expect for their performance, but I'd...
Compare three versions on various input sizes and change patterns (measure separately). Plot the resulting times, comparing three lines on each plot: - `List_unique_lazyrecalc` - `List_unique_name` - `List_unique_arggen`
## High-level Objectives Let's use mergesort as an example to figure out a general principle for programming with "adaptontic" data-structures and computation. The goals are eventually to: - Define **annotation...
The Nominal Adapton interface is broken for functions `cell` and `thunk`. This is my fault. Kyle has been aware of this for a while, but we haven’t prioritized fixing it....