Calculating with lenses: optimising bidirectional transformations

• Type: Article in International Conference Proceedings Book
• Date: 2011

Authors

Pacheco, H (Author) Other; Cunha, A (Author) Other

Conference proceedings International

Title: Proceedings of the 2011 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2011, Austin, TX, USA, January 24-25, 2011

Pages: 91-100

20th ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM'11

Austin, TX, 24 January 2011 through 24 January 2011

Indexing

Scopus - 7 Citations

Other information

Authenticus ID: P-007-XHK

DOI: 10.1145/1929501.1929520

Abstract (EN): This paper presents an equational calculus to reason about bidirectional transformations specified in the point-free style. In particular, it focuses on the so-called lenses as a bidirectional idiom, and shows that many standard laws characterising point-free combinators and recursion patterns are also valid in that setting. A key result is that uniqueness also holds for bidirectional folds and unfolds, thus unleashing the power of fusion as a program optimisation technique. A rewriting system for automatic lens optimisation is also presented, to prove the usefulness of the proposed calculus. © 2011 ACM.

Language: English

Type (Professor's evaluation): Scientific