Skip to content

paper task notes

Scott Kovach edited this page Feb 24, 2024 · 29 revisions
  • toStream for RBNode; high pri
  • compilation reduction example
  • update paper notation
  • section two examples
  • reimplement SparseArray.linearToStream using imap/map? (simplify proofs?)
  • benchmarking script + plots
  • investigate what memo is actually doing; argue that memo is sufficient for all contraction orders
  • demonstrate semiring generality power: implemant the (min, +) semiring, then (min,+) * path sets; then iterate matrix product for shortest path
  • verification
    • core verification
    • SparseArray/linear-scan verification
    • RBNode verification?
  • state tuple allocation issue; can argue around it?
  • hashmap as function (also as traversal?)
  • dense array as function
  • diagrams
    • expansion/multiply/contract diagram (scott to sketch)
  • belief prop algorithm
  • Subtype perf confusion
  • writing
    • related work
    • document elaborator within section on user interface notation/type classes/polymorphism

low pri

  • stream addition
  • array binary search; low pri
  • implement projection (complement of contraction); low pri
  • saturating contraction optimization
  • string radix trie? https://db.in.tum.de/~leis/papers/ART.pdf
  • parallelize something; low pri
  • morphic or rust implementation (good for camera ready)
Clone this wiki locally