Combinators for bi-directional tree transformations: a linguistic approach to the view update problem

By Nate Foster, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, Alan Schmitt. ACM-SIGACT Symposium on Principles of Programming Languages, 2005

550 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Bidirectional model transformations in QVT: semantic issues and open questions (2007, background): “Benjamin Pierce and colleagues in the Harmony group have explored bidirectional transformations extensively in the context of trees [3], and more recently”
Provenance management in curated databases (2006, background): “We make two assumptions about the data, which are already used in file synchronization [12] and database archiving [4] and appear to hold for a wide variety of scientific and other databases.”
Bidirectional Transformations: A Cross-Discipline Perspective (2009, background): “Most systems stipulate that the transformations a bx comprises must obey the definitional properties of correctness and hippocraticness [97] (these properties roughly correspond to PutGet and GetPut laws in the lens framework [42]; for details of this correspondence, see elswhere [30, 99]), with und”