Optimizing structural recursion in functional programs

DOI10.1016/0096-0551(93)90004-KMaRDI QIDQ3142282zbMATH OpenOpenAlexFDO

Authors Peter J. Thiemann

Publication date 15 November 1993

Published in Computer Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-0551(93)90004-k

zbMATH Keywords

eager evaluationimplementation of functional programming languagesoptimizationstructural recursion

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Recommendations

• scientific article; zbMATH DE number 4049007
• Optimizing the stack size of recursive functions
• Structuring FP-style functional programs
• scientific article; zbMATH DE number 1118872
• The optimal implementation of functional programming languages
• Types for Proofs and Programs
• scientific article; zbMATH DE number 3963179
• scientific article; zbMATH DE number 2124969

Cited in

(20)

• Low cost environment changing in a shallow binding system
• Compiling and optimizing methods for the functional language ASL/F
• Efficient handling of data structures in definitional languages
• A general implementation of relational recursion with speedup techniques for programmers
• Improving recursive functions by inverting the order of evaluation
• Optimizing the stack size of recursive functions
• scientific article; zbMATH DE number 1615259 (Why is no real title available?)
• Optimizing abstract SECD machine code
• scientific article; zbMATH DE number 1728386 (Why is no real title available?)
• scientific article; zbMATH DE number 3947595 (Why is no real title available?)
• scientific article; zbMATH DE number 1161584 (Why is no real title available?)
• Algebraic Transformation Techniques for Functional Languages
• scientific article; zbMATH DE number 1904868 (Why is no real title available?)
• scientific article; zbMATH DE number 2090845 (Why is no real title available?)
• scientific article; zbMATH DE number 2124969 (Why is no real title available?)
• Tailoring recursion for complexity
• Mathematics of Program Construction
• Recycling continuations
• Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct
• Compilation of extended recursion in call-by-value functional languages

This page was built for publication: Optimizing structural recursion in functional programs

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