Enhancing semantic bidirectionalization via shape bidirectionalizer plug-ins

Voigtländer, Janis; Hu, Zhenjiang; Matsuda, Kazutaka; Wang, Meng

doi:10.1017/s0956796813000130

Cited by 13 publications

(19 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reflecting in-place updates is a non-trivial problem given complex forward transformations [10]. This limitation of updates can be relaxed to some extent by combining semantic and syntactic bidirectionalization [16,24]. We expect that a similar extension is also applicable to our proposal.…”

Section: Related Workmentioning

confidence: 97%

“…The desirable laws are sometimes considered too restrictive [44,7] because a framework that supports structure changes (insertion and deletion of elements) of views is unlikely to be able to satisfy them (for example, consider a forward transformation map fst and source [("A", 2)], and consider what happens if we change a view from ["A"] to [] and then insert "A" again). In [16,24], where semantic bidirectionalization is combined with another bidirectionalization technique [12] aiming at structure updates, the composability and undoability laws are sacrificed. Further studies on the desirable laws in the presence of insertions and deletions can be found in [43,5,45].…”

Section: Desirable Lawsmentioning

confidence: 99%

“…Consider query Q1 we have seen earlier on ( Figure 2). The attribute value of year and content of publisher are compared to constant values, which instantiates their types to monomorphic ones, and the creation of new element book is also beyond the reach of the existing techniques of semantic bidirectionalization [15,16,24,19] based on the standard free theorems [22].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

“Bidirectionalization for free” for monomorphic transformations

Matsuda

Wang

2015

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

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 with respect to some laws. Over the years, a lot of effort has been made to offer better language support for programming such transformations. In particular, a technique known as bidirectionalization is able to analyze and transform unidirectional programs written in general purpose languages, and "bidirectionalize" them.Among others, an approach termed semantic bidirectionalization proposed by Voigtländer stands out in terms of user-friendliness. A unidirectional program can be written using arbitrary language constructs, as long as the function it represents is polymorphic and the language constructs respect parametricity. The free theorems that follow from the polymorphic type of the program allow a kind of forensic examination of the transformation, determining its effect without examining its implementation. This is convenient, as the programmer is not restricted to using a particular syntax; but it does require the transformation to be polymorphic.In this paper, we lift this polymorphism requirement to improve the applicability of semantic bidirectionalization. Concretely, we provide a type class PackM γ α µ, which intuitively reads "a concrete datatype γ is abstracted to a type α, and the 'observations' made by a transformation on values of type γ are recorded by a monad µ". With PackM , we turn monomorphic transformations into polymorphic ones that are ready to be bidirectionalized. We demonstrate our technique with case studies of typical applications of bidirectional transformation, namely text processing, XML query and graph transformation, which were commonly considered beyond semantic bidirectionalization because of their monomorphic nature.

show abstract

Section: Related Workmentioning

confidence: 97%

Section: Desirable Lawsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

“Bidirectionalization for free” for monomorphic transformations

Matsuda

Wang

2015

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…Different flavors of bidirectionalization have been proposed: syntactic [20], semantic [21,22,33,41], and a combination of the two [35,36]. Syntactic bidirectionalization inspects a forward function definition written in a somehow restricted syntactic representation and synthesizes a definition for the backward version.…”

Section: Semantic Bidirectionalizationmentioning

confidence: 99%

Applicative bidirectional programming with lenses

Matsuda

Wang

2015

Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming

Self Cite

View full text Add to dashboard Cite

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 with respect to some laws. One way to reduce the development and maintenance effort of bidirectional transformations is to have specialized languages in which the resulting programs are bidirectional by constructiongiving rise to the paradigm of bidirectional programming.In this paper, we develop a framework for applicative-style and higher-order bidirectional programming, in which we can write bidirectional transformations as unidirectional programs in standard functional languages, opening up access to the bundle of language features previously only available to conventional unidirectional languages. Our framework essentially bridges two very different approaches of bidirectional programming, namely the lens framework and Voigtländer's semantic bidirectionalization, creating a new programming style that is able to bag benefits from both.

show abstract

“…The question then arises, how much information needs to be included in order to be invertible. This problem has recently deserved much attention in the programming language community (see, e.g., [26]). Our work here was inspired by the very similar view/query determinacy problem.…”

mentioning

confidence: 99%

Decision Problems of Tree Transducers with Origin

Filiot

Maneth

Reynier

et al. 2015

Automata, Languages, and Programming

View full text Add to dashboard Cite

Abstract. A tree transducer with origin translates an input tree into a pair of output tree and origin info. The origin info maps each node in the output tree to the unique input node that created it. In this way, the implementation of the transducer becomes part of its semantics. We show that the landscape of decidable properties changes drastically when origin info is added. For instance, equivalence of nondeterministic top-down and MSO transducers with origin is decidable. Both problems are undecidable without origin. The equivalence of deterministic topdown tree-to-string transducers is decidable with origin, while without origin it is a long standing open problem. With origin, we can decide if a deterministic macro tree transducer can be realized by a deterministic top-down tree transducer; without origin this is an open problem.Tree transducers were invented in the early 1970's as a formal model for compilers and linguistics [24,23]. They are being applied in many fields of computer science, such as syntax-directed translation [13], databases [22,15], linguistics [19,4], programming languages [27,21], and security analysis [16]. The most essential feature of tree transducers is their good balance between expressive power and decidability.Bojańczyk [3] introduces (string) transducers with origin. For "regular" stringto-string transducers with origin he presents a machine independent characterization which admits Angluin-style learning and the decidability of natural subclasses. These results indicate that classes of translations with origin are mathematically better behaved than their origin-less counter parts.We initiate a rigorous study of tree transducers with origin by investigating the decidability of equivalence, injectivity and query determinacy on the following models: top-down tree-to-tree transducers [24,23], top-down tree-to-string transducers [11], and mso definable tree-to-string transducers (see, e.g., [10]).The authors are grateful to Joost Engelfriet for its remarks for improvements and corrections on a preliminary of this work.

show abstract

Enhancing semantic bidirectionalization via shape bidirectionalizer plug-ins

Cited by 13 publications

References 27 publications

“Bidirectionalization for free” for monomorphic transformations

“Bidirectionalization for free” for monomorphic transformations

Applicative bidirectional programming with lenses

Decision Problems of Tree Transducers with Origin

Contact Info

Product

Resources

About