A unified approach to fully lazy sharing

DOI10.1145/2103656.2103713zbMATH Open1321.68136OpenAlexW4241544125MaRDI QIDQ2942896FDOQ2942896

Authors: Thibaut Balabonski 

Publication date: 11 September 2015

Published in: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2103656.2103713

Recommendations

• Weak optimality, and the meaning of sharing
• The call-by-need lambda calculus
• An operational semantics of sharing in lazy evaluation
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Atomic lambda calculus: a typed lambda-calculus with explicit sharing

zbMATH Keywords

optimalitylambda-calculusrewritingsharinglabellingweak reductionlambda-liftingfull laziness

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cited In (7)

• The spirit of node replication
• Nearly serial sharing methods
• Maximal sharing in the lambda calculus with letrec
• Weak optimality, and the meaning of sharing
• Node Replication: Theory And Practice
• Spinal atomic \(\lambda\)-calculus
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: A unified approach to fully lazy sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942896)