Maximal Sharing in the Lambda Calculus with Letrec

C.A. Grabmayer; J. Rochel

doi:10.1145/2628136.2628148

Maximal Sharing in the Lambda Calculus with Letrec

C.A. Grabmayer, J. Rochel

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

Abstract

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 λ

Original language	English
Title of host publication	Proceedings of the 19th ACM SIGPLAN international conference on Functional programming
Editors	J. Jeuring, M.M.T. Chakravarty
Publisher	ACM
Pages	67-80
DOIs	https://doi.org/10.1145/2628136.2628148
Publication status	Published - 2014
Event	ICFP '14 - Duration: 1 Jan 2014 → 1 Jan 2014

Publication series

Name	9

Conference

Conference	ICFP '14
Period	1/01/14 → 1/01/14

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1145/2628136.2628148

Persistent URL (handle)

Copy link address

Cite this

@inproceedings{298a4abff54b4d5eae03599d49daa410,

title = "Maximal Sharing in the Lambda Calculus with Letrec",

abstract = "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 λ",

author = "C.A. Grabmayer and J. Rochel",

year = "2014",

doi = "10.1145/2628136.2628148",

language = "English",

series = "9",

publisher = "ACM",

pages = "67--80",

editor = "J. Jeuring and M.M.T. Chakravarty",

booktitle = "Proceedings of the 19th ACM SIGPLAN international conference on Functional programming",

note = "ICFP '14 ; Conference date: 01-01-2014 Through 01-01-2014",

}

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 λ

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 -

Maximal Sharing in the Lambda Calculus with Letrec

Abstract

Publication series

Conference

UN SDGs

Access to Document

Persistent URL (handle)

Fingerprint

Cite this