Ensuring termination in ESFP

Journal of Universal Computer Science

Volumn 6, Issue 4, 2000, Pages 474-488

  Telford, Alastair ^a   Turner, David ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

Abstract interpretation; Functional programming; Termination analysis

Indexed keywords

EID: 8344279000     PISSN: 0948695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (27)

1. A. Abel. Foetus - termination checker for simple functional programs. World Wide Web page,1998. http://www.informatik.uni-muenchen.de/~abel/publications/foetus/.
2. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press,1998.
3. J. Brauburger and J. Giesl. Termination analysis by inductive evaluation. In C. Kirchner and H. Kirchner, editors. CADE 15, volume 1421 of Lecture Notes in Artificial Intelligence. Springer-Verlag,1998.
4. T. Coquand. Infinite objects in type theory. In H. Barendregt and T. Nipkow, editors, Types for Proofs and Programs (TYPES '93), volume 806 of Lecture Notes in Computer Science, pages 62-78. Springer-Verlag,1993.
5. P. Cousot. Abstract interpretation. ACM Computing Surveys, 28(2):324-328, June 1996.
6. P. Cousot. Types as abstract interpretations. In 24th ACM Symposium on Principles of Programming Languages, pages 316-331, Paris, France, January 1997. ACM Press.
7. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proceedings Sixth ACM Symposium on Principles of Programming Languages, San Antonio, Texas. ACM,1979.
8. P. Cousot and R. Cousot. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation. In PLILP'92: Programming Language Implementation and Logic Programming, volume 631 of Lecture Notes in Computer Science, pages 269-295. Springer-Verlag,1992. Proceedings of the Fourth International Symposium, Leuven, Belgium, 13-17 August 1992.
9. M. C. F. Ferreira and H. Zantema. Syntactical analysis of total termination. In G. Levi and M. Rodrigues-Artalejo, editors, ALP '94, volume 850 of Lecture Notes in Computer Science, pages 204-222. Springer-Verlag,1994.
10. J. Giesl. Termination of nested and mutually recursive algorithms. Journal of Automated Reasoning,19:1-29, August 1997.
11. E. Giménez. Codifying guarded definitions with recursive schemes. In P. Dybjer, B. Nordström, and J. Smith, editors, Types for Proofs and Programs (TYPES '94), volume 996 of Lecture Notes in Computer Science, pages 39-59. Springer-Verlag,1995. International workshop, TYPES '94 held in June 1994.
12. Neil D. Jones, Garsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall,1993.
13. P. Martin-Löf. An intuitionistic theory of types: predicative part. In H.E. Rose and J.C. Shepherdson, editors, Proceedings of the Logic Colloquium. Bristol, July 1973. North Holland 1975.
14. D. McAllester and K. Arkoudas. Walther recursion. In M.A. Robbie and J.K. Slaney, editors, CADE 13, volume 1104 of Lecture Notes in Computer Science, pages 643-657. Springer-Verlag,1996.
15. A.J.R.G. Milner. Theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3):348-375,1978.
16. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML - Revised. MIT Press,1997.
17. Eric G.J.M.H. Nöcker. Strictness analysis using abstract reduction. In Proceedings of Conference on Functional Programming Languages and Computer Architectures. ACM Press,1993.
18. S. Panitz and M. Schmidt-Shauß. TEA: Automatically proving termination of programs in a non-strict higher-order functional language. In P. Van Hentenryck, editor, Static Analysis, volume 1302 of Lecture Notes in Computer Science. Springer-Verlag,1997.
19. S.L. Peyton Jones, R.J.M. Hughes, et al. Haskell 98: A non-strict, purely functional language. WWW page, February 1999. http://haskell.org/definition.
20. C. Reade. Elements of Functional Programming. Addison-Wesley,1989.
21. K. Slind. TFL: An environment for terminating functional programs. WWW page,1998. http://www.cl.cam.ac.uk/users/kxs/tfl.html.
22. A.J. Telford and D.A. Turner. Ensuring Streams Flow. In Michael Johnson, editor, Algebraic Methodology and Software Technology, 6th Int. Conference, AMAST '97, Sydney Australia, December 1997, pages 509-523. AMAST, December 1997.
23. A.J. Telford and D.A. Turner. Ensuring the productivity of infinite structures. Technical Report 14-97, University of Kent at Canterbury,1997.
24. A.J. Telford and D.A. Turner. A Hierarchy of Languages with Strong Termination Properties. Technical Report TR 2-00, University of Kent at Canterbury, February 2000.
25. D.A. Turner. Miranda: A non-strict functional language with polymorphic types. In J.P. Jouannaud, editor, Proceedings IFIP International Conference on Functional Programming Languages and Computer Architecture, volume 201 of Lecture Notes in Computer Science. Springer-Verlag, September 1985.
26. D.A. Turner. Elementary strong functional programming. In P. Hartel and R. Plasmeijer, editors, FPLE 95, volume 1022 of Lecture Notes in Computer Science. Springer-Verlag,1995. 1st International Symposium on Functional Programming Languages in Education. Nijmegen, Netherlands, December 4-6,1995.
27. H. Zantema. Termination of context-sensitive rewriting. In H. Comon, editor, RTA '97, volume 1232 of Lecture Notes in Computer Science, pages 172 - 186. Springer-Verlag,1997.