A unified approach to fully lazy sharing

DOI10.1145/2103656.2103713zbMath1321.68136OpenAlexW4241544125MaRDI QIDQ2942896

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

zbMATH Keywords

optimalitylabellingrewritinglambda-calculussharingweak reductionlambda-liftingfull laziness

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (4)

A strong call-by-need calculus ⋮ Node Replication: Theory And Practice ⋮ Spinal atomic \(\lambda\)-calculus ⋮ The spirit of node replication

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