<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alcino Cunha</style></author><author><style face="normal" font="default" size="100%">Hugo Pacheco</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Multifocal: A Strategic Bidirectional Transformation Language for XML Schemas</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 5th International Conference on Model Transformation - ICMT</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">LNCS</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/alcino/files/icmt12.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Prague, Czech Republic</style></pub-location><volume><style face="normal" font="default" size="100%">7307</style></volume><pages><style face="normal" font="default" size="100%">89–104</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Lenses are one of the most popular approaches to define bidirectional transformations between data models. However, writing a lens transformation typically implies describing the concrete steps that convert values in a source schema to values in a target schema. In contrast, many XML-based languages allow writing structure-shy programs that manipulate only specific parts of XML documents without having to specify the behavior for the remaining structure. In this paper, we propose a structure-shy bidirectional two-level transformation language for XML Schemas, that describes generic type-level transformations over schema representations coupled with value-level bidirectional lenses for document migration. When applying these two-level programs to particular schemas, we employ an existing algebraic rewrite system to optimize the automatically-generated lens transformations, and compile them into Haskell bidirectional executables. We discuss particular examples involving the generic evolution of recursive XML Schemas, and compare their performance gains over non-optimized definitions.&lt;/p&gt;
</style></abstract></record></records></xml>