Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch this 21-minute conference talk from POPL 2025 that introduces Grove, a collaborative structure editor calculus designed to overcome limitations in traditional version control systems. Learn how Grove eliminates patch synthesis and three-way merge algorithms by deriving patches directly from developer edit logs, creating a commutative replicated data type where all edits commute. Discover how Grove represents code as a labeled directed multi-graph with uniquely identified vertices and edges, decomposing graphs into sets of syntax trees that explicitly represent conflicts. The presentation explains Grove's bidirectional type error localization system that ensures all editor states remain statically meaningful, allowing developers to use standard editor services while resolving conflicts. The talk covers the mechanized metatheory using Agda and the implementation of these concepts in the Grove Workbench, which generates necessary data structures and algorithms in OCaml based on syntax tree specifications. Presented by researchers from the National University of Singapore and University of Michigan at the ACM SIGPLAN POPL 2025 conference.
