TEA: Automatically proving termination of programs in a non-strict higher-order functional language

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

Volumn 1302 LNCS, Issue , 1997, Pages 345-360

  Panitz, Sven Eric ^a   Schmidt Schauß, Manfred ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH LEVEL LANGUAGES; PROGRAM COMPILERS; REGRESSION ANALYSIS; STATIC ANALYSIS;

ABSTRACT REDUCTION; FUNCTIONAL LANGUAGES; HIGHER-ORDER; LAZY FUNCTIONAL LANGUAGES; NORMAL FORM; ORDERING CONSTRAINTS; PATH ANALYSIS; SOURCE LANGUAGE;

FUNCTIONAL PROGRAMMING;

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

References (21)

1. T. Arts and J. Giesl. Automatically proving termination where simplification orderings fail. In Michel Bidoit & Max Dauchet, editor, Proceedings of the 7th International Joint Conference on Theory and Practice of Software Development (TAPSOFT '97), number 1214 in Lecture Notes in Computer Science, pages 261-272, Lille, France, 1997. Springer-Verlag.
2. S. Abramsky and C. L. Hankin, editors. Abstract Interpretation of Declarative Languages. Ellis Horwood, 1987.
3. P.H. Andersen and C.K. Hoist. Termination analysis for offiine partial evaluation of a higher order functional language. In Static Analysis, third international symposium, volume 1145 of Lecture Notes in Computer Science, pages 67-82. Springer-Verlag, 1996.
4. R. S. Boyer and J S. Moore. A Computational Logic. Academic Press, 1979.
5. Geoffrey, Burn. Lazy Functional Languages: Abstract Interpretation and Compilation. Pitman, London, 1991.
6. Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pages 252-252. ACM Press, 1977.
7. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1): 69-116, 1987.
8. J. Giesl. Automatisierung yon Terminierungsbeweisen für rekursiv definierte Algorithmen. PhD thesis, Technische Hochschule Darmstadt, 1995.
9. J. Giesl. Termination analysis for functional programs using term orderings. In Alan Mycroft, editor, Static Analysis Symposium '95, number 984 in Lecture Notes in Computer Science, pages 154-171. Springer, 1995.
10. K. Hammond, L. Augustsson, B. Boutel, W. Burton, J. Fairbairn, J. Fasel, A. Gordon, M. Guzmán, J. Hughes, P. Hudak, T. Johnsson, M. Jones, D. Kieburtz, R. Nildail, W. Partain, J. Peterson, S. Peyton Jones, and P. Wadler. Report on the programming language Haskell 1.3. Technical report, Department of Computer Science, University of Glasgow, 1996.
11. Mark P. Jones. The implementation of the Gofer functional programming system. Research Report YALEU/DCS/RR-1030, Yale University, Department of Computer Science, May 1994.
12. S. Kahrs. Towards a domain theory for termination proofs. In Proceedings of the 6th International Conference on Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 241-255. Springer-Verlag, 1995.
13. Hubert Kick. Terminierungsanalyse für den Sprachkern einer nieht-strikten funktionalen Programmiersprache unter Verwendung eines Tableaukalküls fdr abstrakte Reduktion. Master’s thesis, Johann Wolfgang Goethe-Universitäit, Frankfurt, 1997.
14. Eric, Nöcker. Strictness analysis using abstract reduction. In Functional Programming Languages and Computer Architecture, pages 255-265. ACM Press, 1993.
15. S. E. Panitz. Generierung statischer Programminformation zur Kompilierung verzögert ausgewerteter funktionaler Programmiersprachen. (Dissertation), Universitäit Frankfurt, 1997. preliminary version, in German.
16. Marko Schütz. Striktheits-Analyse mittels abstrakter Reduktion für den Sprachkern einer nicht-strikten funktionalen Programmiersprache. Master’s thesis, Johann Wolfgang Goethe-Universität, Frankfurt, 1994.
17. Kirsten Lackner Solberg, Hamae Riis Nielson, and Flemming Nielson. Strictness and totality analysis. In Baudouin Le Charlier, editor, Static Analysis, number 864 in Lecture Notes in Computer Science, pages 408-422. Springer, 1994.
18. M. Schmidt-Schauß, S.E. Panitz, and M. Schütz. Strictness analysis by abstract reduction using a tableau calculus. In Alan Mycroft, editor, Static Analysis Symposium '95, number 983 in Lecture Notes in Computer Science, pages 348-365. Springer, 1995.
19. J. Steinbach. Automatic termination proofs with transformation orderings. In Proceedings of the 6th International Conference on Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 11-25. Springer-Verlag, 1995.
20. Chr. Walther. Automatisierun 9 yon Terminierungsbeweisen. Kiiastliehe Intelligenz. Vieweg, Braunschweig, 1991.
21. Chr. Walther. On proving the termination of algorithms by machine. Artificial Intelligence, 71: 101-157, 1994.