Maximal Sharing in the Lambda Calculus with Letrec

C.A. Grabmayer, J. Rochel

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-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 languageEnglish
Title of host publicationProceedings of the 19th ACM SIGPLAN international conference on Functional programming
EditorsJ. Jeuring, M.M.T. Chakravarty
PublisherACM
Pages67-80
DOIs
Publication statusPublished - 2014
EventICFP '14 -
Duration: 1 Jan 20141 Jan 2014

Publication series

Name9

Conference

ConferenceICFP '14
Period1/01/141/01/14

Cite this