Jump to content

Bidirectional transformation

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Frappyjohn (talk | contribs) at 04:33, 25 June 2016 (→Usage: Copyedit (minor)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer programming, bidirectional transformations (bx) are programs in which a single piece of code can be run in several ways, such that the same data are sometimes considered as input, and sometimes as output. For example, a bx run in the forward direction might transform input I into output O, while the same bx run backward would take as input versions of I and O and produce a new version of I as its output.

Bidirectional model transformations are an important special case in which a model is input to such a program.

Some bidirectional languages are bijective. The bijectivity of a language is a severe restriction of its bidirectionality,[1] because a bijective language is merely relating two different ways to present the very same information.

More general is a lens language, in which there is a distinguished forward direction ("get") that takes a concrete input to an abstract output, discarding some information in the process: the concrete state includes all the information that is in the abstract state, and usually some more. The backward direction ("put") takes a concrete state and an abstract state and computes a new concrete state. Lenses are required to obey certain conditions to ensure sensible behaviour.

The most general case is that of symmetric bidirectional transformations. Here the two states that are related typically share some information, but each also includes some information that is not included in the other.

Usage

Bidirectional transformations can be used to:

  • Maintain the consistency of several sources of information[2]
  • Provide an 'abstract view' to easily manipulate data and write them back to their source

Vocabulary

A bidirectional program which obeys certain round-trip laws is called a lens.

Examples of implementations

  • Boomerang is a programming language which allows writing lenses to process text data formats bidirectionally
  • Augeas is a configuration management library whose lens language is inspired by the Boomerang project
  • biXid is a programming language for processing XML data bidirectionally[3]
  • XSugar allows translation from XML to non-XML formats[4]

See also

References

  1. ^ http://grace.gsdlab.org/images/e/e2/Nate-short.pdf
  2. ^ http://www.cs.cornell.edu/~jnfoster/papers/grace-report.pdf
  3. ^ http://arbre.is.s.u-tokyo.ac.jp/~hahosoya/papers/bixid.pdf
  4. ^ http://www.brics.dk/xsugar/


Stub icon

This computer-programming-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Bidirectional_transformation&oldid=726895281"