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

Combinators for bi-directional tree transformations: A linguistic approach to the view update problem (2005)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by J. Nathan Foster , Michael B. Greenwald , Jonathan T. Moore , Benjamin C. Pierce , Alan Schmitt

Venue:	In ACM SIGPLAN–SIGACT Symposium on Principles of Programming Languages (POPL
Citations:	94 - 13 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Combinators for bi-directional tree transformations: A linguistic approach to the view update problem	INFERENCE
AUTHOR NAME	J. Nathan Foster	SVM HeaderParse 0.2
AUTHOR AFFIL	University of Pennsylvania	SVM HeaderParse 0.2
AUTHOR NAME	Michael B. Greenwald	SVM HeaderParse 0.2
AUTHOR AFFIL	Bell Labs, Lucent Technologies	SVM HeaderParse 0.2
AUTHOR NAME	Jonathan T. Moore	SVM HeaderParse 0.2
AUTHOR AFFIL	University of Pennsylvania	SVM HeaderParse 0.2
AUTHOR NAME	Benjamin C. Pierce	SVM HeaderParse 0.2
AUTHOR AFFIL	University of Pennsylvania	SVM HeaderParse 0.2
AUTHOR NAME	Alan Schmitt	SVM HeaderParse 0.2
AUTHOR AFFIL	INRIA Rhône-Alpes	SVM HeaderParse 0.2
ABSTRACT	We propose a novel approach to the view update problem for tree-structured data: a domainspecific programming language in which all expressions denote bi-directional transformations on trees. In one direction, these transformations—dubbed lenses—map a “concrete ” tree into a simplified “abstract view”; in the other, they map a modified abstract view, together with the original concrete tree, to a correspondingly modified concrete tree. Our design emphasizes both robustness and ease of use, guaranteeing strong well-behavedness and totality properties for welltyped lenses. We identify a natural mathematical space of well-behaved bi-directional transformations over arbitrary structures, study definedness and continuity in this setting, and state a precise connection with the classical theory of “update translation under a constant complement ” from databases. We then instantiate this semantic framework in the form of a collection of lens combinators that can be assembled to describe transformations on trees. These combinators include familiar constructs from functional programming (composition, mapping, projection, conditionals, recursion) together with some novel primitives for manipulating trees (splitting, pruning, copying, merging, etc.). We illustrate the expressiveness of these combinators by developing a number of bi-directional listprocessing transformations as derived forms. An extended example shows how our combinators can be used to define a lens that translates between a native HTML representation of browser bookmarks and a generic abstract bookmark format.	SVM HeaderParse 0.2
YEAR	2005	INFERENCE
VENUE	In ACM SIGPLAN–SIGACT Symposium on Principles of Programming Languages (POPL	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	233--246	INFERENCE
CITATIONS	53 found	ParsCit 1.0