BURSTALL, R. M., AND DARLINGTON, J. "Some transformations for developing recursive programs," in Proc. 1975 Internat. Conf. Reliable Software, Los Angeles, 1975, pp. 465-472.

Crossref

Google Scholar

[7]

CHANDRA, A. K. "Efficient compilation of linear recursive programs," in Conference Record, IEEE 14th Ann. Syrup. Switching and Auto~nata Theory, 1973, pp. 16-25.

Google Scholar

[8]

COHEN, N. H. "Characterization and elimination of redundancy in recursive programs," in 6th Ann. Symp. Principles of Programming Languages, 1979, pp. 143-157.

Crossref

Google Scholar

[9]

HIRSCHBERG, D. S. "A linear space algorithm for computing maximal common subsequences," Commun. ACM 18, 6 (June 1975), 341-343.

Crossref

Google Scholar

[10]

HOROWITZ, E., AND SAHNI, S. Fundamentals of computer algorlthms, Fearon- Pitman, Belmont, Calif., 1979.

Google Scholar

[11]

KNUTH, D.E. The art of computer programming, vol. 2, Addison-Wesley, Reading, Mass., 1969.

Crossref

Google Scholar

[12]

MCCARTHY, J. "On efficient ways of evaluating certain recursive functions," Project MAC A.I. Memo 32 (undated), M.I.T., Cambridge, Mass.

Crossref

Google Scholar

[13]

McCARTHY, J. "A basis for a mathematical theory of computation," in Computer programming and formal systems, E. Braffort and D. Hirschberg (Eds.), North- Holland, Amsterdam, 1963, pp. 33-70.

Google Scholar

[14]

MICHIE, D. "Memo functions: A language feature with rote learning properties," DMIP Memo. MIP-R-29, Edinburgh. 1967.

Google Scholar

[15]

PARTSCH, H., AND PEPPER, P. "A family of rules for recm~i0n removed rehted to the Towers of Hanoi problem," inf. Pro. cess. Lett. 5, 6 (Dec. 1976), }.74-177.

Google Scholar

[16]

PATERSON, 1~. S., AND HEWITT, C. E. "Comparative schematology," in Record of Pro/ect MAC Conf. on Concurrent Sys. terns and Parallel Computation, 1970, pp. 119-127.

Google Scholar

[17]

PAUL, W. J., AND TAtAr, R.oE. "Timespace trade-offs in a pebble game," Acta Inf. l0 (1978), 111-115.

Google Scholar

[18]

PIPPENOER, N. "A time-space tradeoff," J. AOM 25, 4 (1978), ~)9-515.

Crossref

Google Scholar

[19]

REINGOLD, E. M., NIBVEBG~LT, J., AND DEO, N. Combinatorial algorithms: Theory and practice, Prentice-Hall, Englewood Cliffs, N.J., 1977.

Crossref

Google Scholar

[20]

SHORT'r, J. "An iterative program to calculate Fibonacci numbers in O(log n) arithmetic operations," Inf. Process. Lett. 7, 6 (Oct. 1978), 299-303.

Google Scholar

[21]

STEINBRUGGEN, R. "Equivalent recursire definitions of ce~gin number theoretical functions," TUM-INFO-7714, Technische Univ. Miinchen, West Germany, 1977.

Google Scholar

[22]

VOROBOYOV, N.N. The Fibonacci numbers, D. C. Heath, Boston, Mass., 1966.

Google Scholar

[23]

WALKER, S.A. "Some graph games related to the efficient calculation of expressions," IBM Res./~.p. RC-3628., 1971.

Google Scholar

[24]

WATANABE, O. "Another application of recursion introduction," Inf. Process. Lett. 10, 3 (1980), 116-119.

Google Scholar

[25]

WEL~, M. B. "Elements of combinato. rial computing, Pergamon Press, Elmsford, N.Y., 1971.

Google Scholar

[26]

WIRTH, N. Algorithms + data structures - programs, l~entice-Hall, EngleWood Cliffs, N.J., 1976.

Crossref

Google Scholar

Cited By

View all

Pereira FRaposo CNaik MPereira FTitzer B(2024)The Essence of the Flyweight Design PatternProceedings of the Workshop Dedicated to Jens Palsberg on the Occasion of His 60th Birthday10.1145/3694848.3694855(30-38)Online publication date: 22-Oct-2024
https://dl.acm.org/doi/10.1145/3694848.3694855
van Balen DKeller Gde Wolff IMcDonell TRainey MScholz S(2024)Fusing Gathers with Integer Linear ProgrammingProceedings of the 1st ACM SIGPLAN International Workshop on Functional Programming for Productivity and Performance10.1145/3677997.3678227(10-23)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1145/3677997.3678227
Chang JCui BNargesian FAsudeh AJagadish H(2024)Data distribution tailoring revisited: cost-efficient integration of representative dataThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-024-00849-w33:5(1283-1306)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1007/s00778-024-00849-w
Show More Cited By

Recommendations

The optimal approach to recursive programs

The classical fixedpoint approach toward recursive programs suggests choosing the “least defined fixedpoint” as the most appropriate solution to a recursive program. A new approach is described which introduces an “optimal fixedpoint,” which, in ...
The optimal fixedpoint of recursive programs
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computing

In this paper a new fixedpoint approach towards the semantics of recursive programs is presented. The fixedpoint defined by a recursive program under this semantics contains, in some sense, the maximal amount of “interesting” information which can be ...
A linearization of non-linear recursive programs in logic databases

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM Computing Surveys Volume 12, Issue 4

Dec. 1980

105 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/356827

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1980

Published in CSUR Volume 12, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

149
Total Citations
View Citations
1,447
Total Downloads

Downloads (Last 12 months)189
Downloads (Last 6 weeks)29

Reflects downloads up to 13 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Pereira FRaposo CNaik MPereira FTitzer B(2024)The Essence of the Flyweight Design PatternProceedings of the Workshop Dedicated to Jens Palsberg on the Occasion of His 60th Birthday10.1145/3694848.3694855(30-38)Online publication date: 22-Oct-2024
https://dl.acm.org/doi/10.1145/3694848.3694855
van Balen DKeller Gde Wolff IMcDonell TRainey MScholz S(2024)Fusing Gathers with Integer Linear ProgrammingProceedings of the 1st ACM SIGPLAN International Workshop on Functional Programming for Productivity and Performance10.1145/3677997.3678227(10-23)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1145/3677997.3678227
Chang JCui BNargesian FAsudeh AJagadish H(2024)Data distribution tailoring revisited: cost-efficient integration of representative dataThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-024-00849-w33:5(1283-1306)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1007/s00778-024-00849-w
Viera MPardo ASaraiva J(2024)Tabulation with ZippersFunctional and Logic Programming10.1007/978-981-97-2300-3_5(83-98)Online publication date: 15-May-2024
https://dl.acm.org/doi/10.1007/978-981-97-2300-3_5
Ali IZhang H(2023)Optimizing SLAM Evaluation Footprint Through Dynamic Range Coverage Analysis of Datasets2023 Seventh IEEE International Conference on Robotic Computing (IRC)10.1109/IRC59093.2023.00030(127-134)Online publication date: 11-Dec-2023
https://doi.org/10.1109/IRC59093.2023.00030
Dasgupta IGershman S(2021)Memory as a Computational ResourceTrends in Cognitive Sciences10.1016/j.tics.2020.12.008Online publication date: Jan-2021
https://doi.org/10.1016/j.tics.2020.12.008
Duta CGrust TMaier DPottinger RDoan ATan WAlawini ANgo H(2020)Functional-Style SQL UDFs With a Capital 'F'Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3389707(1273-1287)Online publication date: 11-Jun-2020
https://dl.acm.org/doi/10.1145/3318464.3389707
MacDonough ACaspersen MEdwards SBarnes TGarcia D(2017)Recursive ConvergenceProceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education10.1145/3017680.3022457(771-772)Online publication date: 8-Mar-2017
https://dl.acm.org/doi/10.1145/3017680.3022457
Velázquez-Iturbide JHernán-Losada IParedes-Velasco M(2017)Evaluating the Effect of Program Visualization on Student MotivationIEEE Transactions on Education10.1109/TE.2017.264878160:3(238-245)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1109/TE.2017.2648781
Bae JKim JMoon IKim T(2017)Accelerated simulation of hierarchical military operations with tabulation techniqueJournal of Simulation10.1057/jos.2014.3710:1(36-49)Online publication date: 19-Dec-2017
https://doi.org/10.1057/jos.2014.37
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Recommendations

The optimal approach to recursive programs

The optimal fixedpoint of recursive programs

A linearization of non-linear recursive programs in logic databases

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations