Finiteness analysis

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

Volumn 523 LNCS, Issue , 1991, Pages 473-495

  Holst, Carsten Kehler ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

Abstract interpretation; Finiteness; Memoisation; Partial evaluation; Quasi termination; Termination; Transition analysis induction

Indexed keywords

ABSTRACTING; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; SEMANTICS;

ABSTRACT INTERPRETATIONS; FINITENESS; MEMOISATION; PARTIAL EVALUATION; QUASI-TERMINATION; TERMINATION; TRANSITION ANALYSIS;

FUNCTIONAL PROGRAMMING;

EID: 84957654033     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3540543961_23     Document Type: Conference Paper

References (15)

1. Anders Bondorf. Automatic autoprojection of higher order recursive equations. In Neil D. Jones, editor, 3rd European Symposium on Programming (ESOP ‘90), volume 432 of Lecture Notes in Computer Science, pages 70–87, Copenhagen, Denmark, May 1990. Springer-Verlag.
2. G. L. Burn, C. L. Hankin, and S Abramsky. The theory of strictness analysis for higher order functions. In H. Ganzinger and N. D. Jones, editors, Programs as Data Structures, pages 42–62. Lecture Notes in Computer Science, October 1985.
3. Charles Consel. New insights into partial evaluation: The schism experiment. In Harald Ganzinger, editor, 2nd European Symposium on Programming, (ESOP ‘88), volume 300 of Lecture Notes in Computer Science, pages 236–247, Nancy, France, 1988. Springer-Verlag.
4. Nachum Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69–116, 1987.
5. Neil D. Jones. Automatic program specialization: A re-examination from basic principles. In A.P. Ershov D. Bjørner and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 225–282. North-Holland, 1988.
6. Neil D. Jones and Tine Andersen. Notes on a safe binding time analysis. Internal note., 1989.
7. Neil D. Jones, Carsten K. Gomard, Anders Bondorf, Olivier Danvier, and Torben Æ. Mogensen. A self-applicable partial evaluator for the lambda-calculus. In 1990 Interational Conference on Computer Languages. IEEE computer Society, 1990.
8. Neil D. Jones and Allan Mycroft. Data flow analysis of applicative programs using minimal function graphs. In Thirteenth ACM Symposium on Principles of Programming Languages, St. Petersburg, Florida, pages 296–306. ACM, 1986.
9. Neil D. Jones, Peter Sestoft, and Harald Søndergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1):9–50, 1989.
10. S. C. Kleene. Introduction to Metamathematics. D. van Nostrand, Princeton, New Jersey, 1952.
11. Torben Æ. Mogensen. Partially static structures in a self-applicable partial evaluator. In A.P. Ershov D. Bjørner and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 325–347. North-Holland, 1988.
12. Lutz Plümer. Termination Proofs for Logic Programs, volume 446 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1990.
13. Peter Sestoft. The structure of a self-applicable partial evaluator. In Harald Ganzinger and Neil D. Jones, editors, Programs as Data Objects, volume 217 of Lecture Notes in Computer Science, pages 236–256, Copenhagen, Denmark, 1986. Springer-Verlag.
14. Peter Sestoft. Automatic call unfolding in a partial evaluator. In A.P. Ershov D. Bjørner and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 485–506. North-Holland, 1988.
15. V. F. Turchin. The algorithm of generalization in the supercompiler. In A.P. Ershov D. Bjørner and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 531–549. North-Holland, 1988.