Repetitive reduction patterns in lambda calculus with \texttt{letrec} (work in progress)

MaRDI QIDQ4964706zbMATH OpenFDO

Authors Jan Rochel, Clemens Grabmayer

Publication date 3 March 2021

Full work available at URL https://arxiv.org/abs/1102.2656, http://eptcs.web.cse.unsw.edu.au/paper.cgi?TERMGRAPH2011.9

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Maximal sharing in the lambda calculus with letrec
• Lambda calculus with explicit recursion
• Shrinking lambda expressions in linear time
• scientific article; zbMATH DE number 4039260
• \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus

Cited in

(2)

• Maximal sharing in the lambda calculus with letrec
• Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct

This page was built for publication: Repetitive reduction patterns in lambda calculus with \texttt{letrec} (work in progress)

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