Notes on recursion elimination
From MaRDI portal
Publication:4130958
DOI10.1145/359605.359630zbMath0358.68016OpenAlexW2065302945MaRDI QIDQ4130958
Publication date: 1977
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359605.359630
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (4)
PROPOSITIONAL DYNAMIC LOGIC FOR REASONING ABOUT FIRST-CLASS AGENT INTERACTION PROTOCOLS ⋮ Unnamed Item ⋮ Stack and locally finite transformations on structures with reversible transitions ⋮ Eliminating recursion from combinatoric procedures
This page was built for publication: Notes on recursion elimination
