Recursion versus iteration at higher-orders

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1346, Issue , 1997, Pages 57-73

  Kfoury, A J ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; SEMANTICS;

CALL-BY-NAME; FIRST ORDER; HIGHER-ORDER; HIGHER-ORDER LANGUAGES; PROGRAM SCHEMES; RECURSION REMOVAL; RECURSIONS; RECURSIVE PROGRAMS;

PROGRAM TRANSLATORS;

EID: 84923180857     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0058023     Document Type: Conference Paper

References (23)

1. Abelson, H., and Sussman, G., Structure And Interpretation Of Computer Progams, MIT Press/McGraw-Hill, NY, 1984.
2. Aho, A.V. and Ullman, J.D., Principles of Compiler Design, Addison-Wesley, 1979.
3. Ausländer, M.A., and Strong, H.R., "Systematic recursion removal", Communications ACM, 21, no. 2, pp 127-134, Feb 1978.
4. Barendregt, H.P., The Lambda Calculus, Its Syntax and Semantics, revised edition, North-Holland, Amsterdam, 1984.
5. Böhm, C., and Berarducci, A., "Automatic synthesis of typed lambda-programs on term algebras", Theoretical Computer Science, 39, pp 135-154, 1985.
6. Friedman, D.P., Wand, M., and Haynes, C.T., Essentials of Programming Languages, MIT Press/McGraw-Hill, NY, 1992.
7. Goerdt, A., "On the computational power of the finitely typed lambda-terms", in Proceedings of 13th MFCS, LNCS 324, pp 318-328, 1988.
8. Greibach, S.A., Theory of Program Structures: Schemes, Semantics, Verification, LNCS 36, Springer-Verlag, 1975.
9. Hillebrand, G.G., Kanellakis, P.C., Mairson, H.G., and Vardi, M.Y., "Undecidable Boundedness Problems for Datalog Programs", Journal of Logic Programming 25:2, pp 163-190, 1995.
10. Kamin, S.N., Programming Languages: An Interpreter-Based Approach, Addison-Wesley, 1990.
11. Kfoury, A.J., Tiuryn, J., and Urzyczyn, P., "On the expressive power of finitely typed and universally polymorphic recursive procedures", Theoretical Computer Science, 93, pp 1-41, 1992.
12. Kfoury, A.J., "Recursion, Tail-Recursion, and Iteration at Higher-Orders". In preparation.
13. Kozen, D., and Tiuryn, J., "Logics of Programs", in Handbook of Theoretical Computer Science, Vol. B, Formal Methods and Semantics, ed. J. van Leeuven, Elsevier Science Publ. and The MIT Press, pp 789-840, 1990.
14. Mitchell, J.C., Foundations for Programming Languages, MIT Press, Cambridge, Mass, 1996.
15. Moschovakis, Y.N., Elementary Induction on Abstract Structures, North-Holland, 1974.
16. Moschovakis, Y.N., "The Formal Language of Recursion", Journal of Symbolic Logic, 54, pp 1216-1252, 1989.
17. Paterson, M.S., and Hewitt, C., "Comparative schematology", MIT A.I. Lab Technical Memo № 201 (also in Proc. of Project MAC Conference on Concurrent Systems and Parallel Computation), 1970.
18. Peyton Jones, S.L., The Implementation of Functional Programming Languages, Prentice-Hall, 1987.
19. Pippenger, N., "Pebbling", Fifth Symposium on Mathematical Foundations of Computer Science, IBM Japan, 1980.
20. Pippenger, N., "Advances in Pebbling", Proc. of 9th ICALP, LNCS no. 140, Springer-Verlag, 1982.
21. Statman, R., "The typed λ-calculus is not elementary recursive", Theoretical Computer Science, 9, pp 73-81, 1979.
22. Strong, H.R., "Translating recursion equations into flowcharts", J. Computer and System Sciences, 5, pp 254-285, 1971.
23. Walker, S.A. and Strong, H.R., "Characterizations of flowchartable recursions", J. Computer and System Sciences, 7, pp 404-447, 1973.