Some Techniques for Recursion Removal from Recursive Functions

DOI10.1145/357162.357171MaRDI QIDQ3339250zbMATH OpenOpenAlexFDO

Authors

Publication date 1982

Published in ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/357162.357171

zbMATH Keywords

computation tracesnonprocedural languagesrecursion removalsemantics of program languagestail recursion

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of software (68N01)

Cited in

(7)

• A new approach to recursion removal
• Deductive and inductive synthesis of equational programs
• Removing Redundant Arguments of Functions*
• Propositional dynamic logic for reasoning about first-class agent interaction protocols
• La fonction d'Ackermann : un nouveau mode de dérécursivation
• Total unfolding: theory and applications
• Synthetic programming

This page was built for publication: Some Techniques for Recursion Removal from Recursive Functions

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