Bidirectionalizing Tree Transformation Languages: A Case Study

スポンサーリンク

概要

• 論文の詳細を見る

• A transformation from the source data to a target view is said to be bidirectional if, when the target is altered, the transformation somehow induces a way to reflect the changes back to the source, with the updated source satisfying certain healthiness conditions. Several bidirectional transformation languages have been proposed. In this paper, on the other hand, we aim at making existing transformations bidirectional. As a case study we chose the Haskell combinator library, HaXML, and embed it into Inv, a language the authors previously developed to deal with bidirectional updating. With the embedding, existing HaXML transformations gain bidirectionality.

著者

• Hu Zhenjiang

  Graduate School of Information Science and Technology, University of Tokyo

• Mu Shin-Cheng

  Graduate School of Information Science and Technology, University of Tokyo

• Takeichi Masato

  Graduate School of Information Science and Technology, University of Tokyo

関連論文

• Bidirectionalizing Tree Transformation Languages: A Case Study

スポンサーリンク