J. Nathan Foster

TL;DR: A novel approach to the view-update problem for tree-structured data: a domain-specific programming language in which all expressions denote bidirectional transformations on trees that map a concrete tree into a simplified abstract view and a modified abstract view to a correspondingly modified concrete tree.

TL;DR: An initial set of benchmarks for measuring progress in this area of programming languages are proposed, based on the metatheory of System F<:, a typed lambda-calculus with second-order polymorphism, subtyping, and records.

TL;DR: The state of the art and technical presentations delivered at the GRACE International Meeting on Bidirectional Transformations are surveyed and a new effort to establish a benchmark for bidirectional transformations is introduced.

TL;DR: The essential property of resourcefulness is formalized-the correct use of keys to associate chunks in the input and output-by defining a refined semantic space of quasi-oblivious lenses, which several previously studied properties of lenses turn out to have compact characterizations in this space.

TL;DR: A novel approach to the well-known view update problem for the case of tree-structured data is proposed: a domain-specific programming language in which all expressions denote bi-directional transformations on trees.