A Unified Approach to Fully Lazy Sharing

作者：Balabonski Thibaut^*

来源：ACM Sigplan Notices, 2012, 47(1): 469-480.

DOI：10.1145/2103621.2103713

• Theory
• Languages
• Sharing
• Full laziness
• Lambda-lifting
• Rewriting
• Lambda-calculus
• Weak reduction
• Optimality
• Labelling

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 rewriting systems by expressing fully lazy lambda-lifting in our framework, thus emphasizing the first-order essence of weak reduction.

• 出版日期2012-1