Termination analysis for offline partial evaluation of a higher order functional language

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

Volumn 1145, Issue , 1996, Pages 67-82

  Andersen, Peter Holst ^a   Holst, Carsten Kehler ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b Prolog Development Center   (Denmark)

Author keywords

Abstract interpretation; Partial evaluation; Size analysis; Termination

Indexed keywords

FUNCTIONS;

ABSTRACT INTERPRETATIONS; FUNCTIONAL LANGUAGES; HIGHER ORDER FUNCTIONS; OFFLINE PARTIAL EVALUATION; PARTIAL EVALUATION; SIZE ANALYSIS; TERMINATION; TERMINATION ANALYSIS;

STATIC ANALYSIS;

EID: 84957610563     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61739-6_34     Document Type: Conference Paper

References (15)

1. The Similix system, version 5.1. 1995.
2. Lars Ole Andersen. Binding-time analysis and the taming of C pointers. In David Schmidt, editor, Proc. of ACM Symposium on Partial Evaluation and Semantics- Based Program Manipulation, PEPM'93, pages 47-58, 1993.
3. Lars Ole Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, May 1994. (DIKU report 94/19).
4. Peter Holst Andersen and Carsten Kehler Holst. Termination Analysis for Offline Partial Evaluation of a Higher Order Functional Language. Technical Report, DIKU, University of Copenhagen, Denmark, 1996. To appear.
5. Anders Bondorf and Jesper Jørgensen. Efficient analyses for realistic off-line partial evaluation: extended version. Technical Report 93/4, DIKU, University of Copenhagen, Denmark, 1993.
6. Charles Consel. A tour of Schism: a partial evaluation system for higher-order applicative languages. In David Schmidt, editor, ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, pages 145-154, June 1993.
7. Charles Consel and Olivier Danvy. Partial evaluation of pattern matching in strings. Information Processing Letters, 30:79-86, January 1989.
8. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge Mathematical Textbooks, Cambridge University Press, 1990.
9. Arne J. Glenstrup and Neil D. Jones. BTA algorithms to ensure termination of off-line partial evaluation. In Andrei Ershov Second International Conference "Perspectives of System Informatics," Lecture Notes in Computer Science, 1996. Upcoming.
10. Carsten Kehler Holst. Finiteness analysis. In John Hughes, editor, Functional Programming Languages and Computer Architectures, pages 473-495, ACM, Springer- Verlag, Cambridge, Massachusetts, USA, August 1991.
11. Neil D. Jones, Carsten Gomaxd, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. C.A.R. Hoare, Series Editor, Prentice Hall International, International Series in Computer Science, June 1993. ISBN number 0-13020249-5 (pbk).
12. Neil D. Jones and Steven S. Muchnick. Flow analysis and optimization of Lisplike structures. In Steven S. Muchnick and Neil D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 4, pages 102-131, Prentice-Hall, 1981.
13. H.G. Rice. Classes of recursively enumerable sets and their decision problems. Transaction of the AMS, 89:25-59, 1953.
14. Peter Sestoft. Replacing Function Parameters by Global Variables. Master's thesis, DIKU, University of Copenhagen, Denmark, October 1988. 107 pages.
15. David N. Turner, Philip Wadler, and Christian Mossin. Once upon a type. In 7'th International Conference on Functional Programming and Computer Architecture, pages 1-11, ACM Press, La Jolla, California, June 1995.