Some Techniques for Recursion Removal from Recursive Functions

DOI10.1145/357162.357171zbMath0547.68009OpenAlexW1968602872MaRDI QIDQ3339250

No author found.

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

tail recursioncomputation tracesrecursion removalnonprocedural languagessemantics of program languages

Mathematics Subject Classification ID

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

Related Items (5)

La fonction d'Ackermann : un nouveau mode de dérécursivation ⋮ PROPOSITIONAL DYNAMIC LOGIC FOR REASONING ABOUT FIRST-CLASS AGENT INTERACTION PROTOCOLS ⋮ Synthetic programming ⋮ Total unfolding: theory and applications ⋮ Deductive and inductive synthesis of equational programs

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