@conference {CunhaPacheco:11b,
	title = {Calculating with Lenses: Optimising Bidirectional Transformations},
	booktitle = {Proceedings of the 20th ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation },
	year = {2011},
	month = {January },
	pages = {91{\textendash}100},
	publisher = {ACM Press},
	organization = {ACM Press},
	address = {Austin, USA},
	abstract = {<p>This paper presents an equational calculus to reason about bidirectional transformations specified in the point-free style. In particular, it focuses on the so-calledlenses 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.</p>
},
	attachments = {https://haslab.uminho.pt/sites/default/files/alcino/files/pepm11.pdf},
	author = {Alcino Cunha and Hugo Pacheco}
}