Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Categorical Theory of Patches

Hunter Madison
August 24, 2016
65

Categorical Theory of Patches

Hunter Madison

August 24, 2016
Tweet

Transcript

  1. Group • Set of elements, with an operation which combines

    any two elements to form a third element • The operation satisfies the group axioms (Closure, Associativity, Identity and Invertibility)
  2. Category • Objects linked by morphisms (functions) • We only

    care about Associativity, Identity • Mesh Like
  3. Category By IkamusumeFan - Own work, CC BY-SA 4.0, https://

    commons.wikimedia.org/w/index.php?curid=36599484
  4. L • Is the set of all files and patches

    • Is partially ordered (vs linearly ordered) • We can use a pushout to resolve our merges
  5. This paper, I love • Its not going to replace

    the one true VCS • But, we can use it to recast to a different model
  6. Recasting • Instead of focusing on how to solve corner

    cases, we can instead find a general solution and build a concrete description • In general, we can do this for any problem
  7. Reading List • “A FORMALIZATION OF DARCS PATCH THEORY USING

    INVERSE SEMIGROUPS” - ftp:// ftp.math.ucla.edu/pub/camreport/cam09-83.pdf • “Camp Path Theory” - http://projects.haskell.org/ camp/files/theory.pdf • “The Theory of patches-vector” - http:// liamoc.net/posts/2015-11-10-patch-theory.html