Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct
From MaRDI portal
Publication:812087
DOI10.1007/S10990-005-4878-3zbMath1086.68524OpenAlexW2096081453MaRDI QIDQ812087
Dipanwita Sarkar, R. Kent Dybvig, Oscar Waddell
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
modulesoptimizationSchemeinternal definitionsletrec restrictionmutual recursionrecursive binding construct
Related Items (3)
Compilation of extended recursion in call-by-value functional languages ⋮ An abstract monadic semantics for value recursion ⋮ Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct
Cites Work
This page was built for publication: Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct
