Towards a Complete Picture of Lens Laws
Programming Languages
2019-10-24 v1 Databases
Abstract
Bidirectional transformation, also called lens, has played important roles in maintaining consistency in many fields of applications. A lens is specified by a pair of forward and backward functions which relate to each other in a consistent manner. The relation is formalized as a set of equations called lens laws. This report investigates precise dependencies among lens laws: which law implies another and which combination of laws implies another. The set of such implications forms a complicated graph structure. It would be helpful to check a well-definedness of bidirectional transformation in a lightweight way.
Cite
@article{arxiv.1910.10421,
title = {Towards a Complete Picture of Lens Laws},
author = {Keisuke Nakano},
journal= {arXiv preprint arXiv:1910.10421},
year = {2019}
}
Comments
Proceedings of the Third Workshop on Software Foundations for Data Interoperability (SFDI2019+), October 28, 2019, Fukuoka, Japan