Highly Influenced

@inproceedings{Balabonski2012AUA, title={A unified approach to fully lazy sharing}, author={Thibaut Balabonski}, booktitle={POPL}, year={2012} }

- Published 2012 in POPL
DOI:10.1145/2103656.2103713

We give an axiomatic presentation of sharing-via-labelling for weak lambda-calculi, that makes it possible to formally compare many different approaches to fully lazy sharing, and obtain two important results. We prove that the known implementations of full laziness are all equivalent in terms of the number of beta-reductions performed, although they behave differently regarding the duplication of terms. We establish a link between the optimality theories of weak lambda-calculi and first-order… CONTINUE READING

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=2103713.

### Presentations referencing similar topics