CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Incremental Updates for Efficient Bidirectional Transformations

Meng Wang (Institutionen för data- och informationsteknik, Software Engineering (Chalmers)) ; Jeremy Gibbons ; Nicolas Wu
ICFP'11 The 16th ACM SIGPLAN International Conference on Functional Programming p. 392-403. (2011)
[Konferensbidrag, refereegranskat]

A bidirectional transformation is a pair of mappings between source and view data objects, one in each direction. When the view is modified, the source is updated accordingly. The key to handling large data objects that are subject to relatively small modifications is to process the updates incrementally. Incrementality has been explored in the semi-structured settings of relational databases and graph transformations; this flexibility in structure makes it relatively easy to divide the data into separate parts that can be transformed and updated independently. The same is not true if the data is to be encoded with more general-purpose algebraic datatypes, with transformations defined as functions: dividing data into welltyped separate parts is tricky, and recursions typically create interdependencies. In this paper, we study transformations that support incremental updates, and devise a constructive process to achieve this incrementality.

Nyckelord: Bidirectional programming, Functional programming, Incremental computing, Program transformation, View-update problem

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2011-07-20. Senast ändrad 2011-11-22.
CPL Pubid: 143549


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)