Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct

DOI10.1007/S10990-005-4878-3MaRDI QIDQ812087zbMATH OpenOpenAlexFDO

Authors Oscar Waddell, Dipanwita Sarkar, R. Kent Dybvig

Publication date 23 January 2006

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10990-005-4878-3

zbMATH Keywords

internal definitionsletrec restrictionmodulesmutual recursionoptimizationrecursive binding constructScheme

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• Repetitive reduction patterns in lambda calculus with \texttt{letrec} (work in progress)
• A variadic extension of Curry's fixed-point combinator
• Compilation of extended recursion in call-by-value functional languages
• Optimizing structural recursion in functional programs
• Revised report on the algorithmic language scheme

Cites work

• Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct

Cited in

(4)

• An abstract monadic semantics for value recursion
• Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct
• A variadic extension of Curry's fixed-point combinator
• Compilation of extended recursion in call-by-value functional languages

This page was built for publication: Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct

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