flâneur

Bidirectional transformation - Wikipedia

en.wikipedia.org · 919 words · saved by 1 readers

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 power,[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 th

Bidirectional transformation - Wikipedia Jump to content From Wikipedia, the free encyclopedia Computer programs able to produce inputs from outputs 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 transforma

related reading