Termination analysis of higher-order functional programs

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

Volumn 3780 LNCS, Issue , 2005, Pages 281-297

  Sereni, Damien ^a   Jones, Neil D ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONAL LANGUAGES; FUNCTIONAL PROGRAMS; SIZE-CHANGE TERMINATION (SCT); TERMINATION ANALYSIS;

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; DATA REDUCTION;

AUTOMATIC PROGRAMMING;

EID: 33646731562     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575467_19     Document Type: Conference Paper

References (19)

1. J. Avery. Size-change termination for programs with non-well-founded data. Graduate project, University of Copenhagen.
2. R. Bird. Using circular programs to eliminate multiple traversais of data. Acta Informatica, 21:239-250, 1984.
3. O. Danvy. Lambda-lifting in quadratic time. In FLOPS, volume 2441 of Lecture Notes in Computer Science, pages 134-151. Springer, 2002.
4. J. Giesl, R. Thiemann, and P. Schneider-Kamp. Proving and disproving termination of higher-order functions. In Proceedings of the 5th International Workshop of Frontiers of Combining Systems, volume 3717 of Lecture Notes in Artificial Intelligence, pages 216-231, 2005.
5. J.-Y. Girard, P. Taylor, and Y. Lafont. Proofs and Types. Cambridge tracts in Theoretical Computer Science. Cambridge University Press, 1989.
6. M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
7. T. Johnsson. Lambda lifting: transforming programs to recursive equations. In Proceedings of a conference on Functional Programming languages and Computer Architecture. Springer-Verlag, 1985.
8. N. D. Jones and N. Bohr. Termination analysis of the untyped A-calculus. In Proceedings of the 15th International Conference on Rewriting Techniques and Applications, volume 3091 of Lecture Notes in Computer Science, pages 1-23, 2004.
9. P. J. Landin. The mechanical evaluation of expressions. The Computer Journal, 6:308-320, 1964.
10. C. S. Lee, N. D. Jones, and A. M. Ben-Amram. The size-change principle for program termination. In Proceedings of the 28th Annual ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languagaes, pages 81-92, New York, NY, USA, 2001. ACM Press.
11. X. Leroy. The Objective Caml System: Documentation and User's Manual, 2004.
12. N. Lindenstrauss and Y. Sagiv. Automatic termination analysis of prolog programs. In Proceedings of the Fourteenth International Conference on Logic Programming, pages 64-67, 1997.
13. C. Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998.
14. S. Peyton-Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987.
15. D. Sereni. Higher-order size-change termination analyser. Available at http://web.comlab.ox.ac.uk/oucl/work/damien.sereni/hoterm.tar.gz, 2004.
16. D. Sereni. Termination analysis of higher-order functional programs. Technical Report PRG-RR-04-20, Oxford University Computing Laboratory, 2004. http://web.comlab.ox.ac.uk/oucl/publications/tr/rr-04-20.html.
17. O. Shivers. Control-flow analysis in scheme. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, pages 164-174, June 1988.
18. O. Shivers. Control-Flow Analysis of Higher-Order Languages. PhD thesis, Carnegie Mellon University, May 1991.
19. K. Slind. Reasoning about Terminating Functional Programs. PhD thesis, Institut für Informatik der Technischen Universität München, 1999.