TY - GEN
T1 - Maximal Sharing in the Lambda Calculus with Letrec
AU - Grabmayer, C.A.
AU - Rochel, J.
PY - 2014
Y1 - 2014
N2 - Increasing sharing in programs is desirable to compactify the code, and to avoid duplication of reduction work at run-time, thereby speeding up execution. We show how a maximal degree of sharing can be obtained for programs expressed as terms in the lambda calculus with letrec. We introduce a notion of 'maximal compactness' for λ
AB - Increasing sharing in programs is desirable to compactify the code, and to avoid duplication of reduction work at run-time, thereby speeding up execution. We show how a maximal degree of sharing can be obtained for programs expressed as terms in the lambda calculus with letrec. We introduce a notion of 'maximal compactness' for λ
UR - https://www.scopus.com/pages/publications/84907011559
UR - https://www.scopus.com/inward/citedby.url?scp=84907011559&partnerID=8YFLogxK
U2 - 10.1145/2628136.2628148
DO - 10.1145/2628136.2628148
M3 - Conference contribution
T3 - 9
SP - 67
EP - 80
BT - Proceedings of the 19th ACM SIGPLAN international conference on Functional programming
A2 - Jeuring, J.
A2 - Chakravarty, M.M.T.
PB - ACM
T2 - ICFP '14
Y2 - 1 January 2014 through 1 January 2014
ER -
