A naïve time analysis and its theory of cost equivalence

Journal of Logic and Computation

Volumn 5, Issue 4, 1995, Pages 495-541

  Sands, David ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Lazy evaluation; Operational semantics.; Time analysis

Indexed keywords

EID: 0003376597     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/5.4.495     Document Type: Article

References (43)

1. S. Abramsky. The lazy lambda calculus. In Research Topics m Functtoml Programming, D. Turner, ed, pp 65-116. Addison We& ey, 1990.
2. V. Aho, J E Hopcroft and J. D Ullman. The Design and Analysis of Computer Algorithms The Addison- We& ey Senes in Computer Science and Information Processing. Addison-We& ey, London, 1974.
3. Z. M. Anola and Arvmd A, syntactic approach to program transformation. In Proceedings of the symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 116-129 ACM Press, SIGPLAN notices, 26(9), September 1991.
4. H. P. Barendregt, The Lambda Calculus, vol 103 of Studies in Logic and the Foundations of Mathematics. Elsevier Science Publishers B V, 2nd edition, 1984.
5. H. P. Barendregt, M. C J. D van Eelcelen, J. R W. dauert, J R. Kennaway, M J Plasmajer Term graph rewriting. In PARLE '87 volume 2, number 259 in LNCS, pp 191-231 Springer Verlag, 1987.
6. R. Bird and P. Wadler, Introduction to Functional Programming Prentice Hall, 1988
7. B Bjeroer, Time Complexity of Programs in Type Theory PhD thesis, Chalmers University of Technology, 1989
8. B Bjemer and S Holmström, A compositional approach to time analysis of first order lazy functional programs. In Functional Programming Languages and Computer Architecture, Conference Proceedings, pp 157-165 ACM Press, 1989
9. S Brookes and S Geva. Computational comonads and intensional semantics. In Categories m Computer Science, M P Fourman, P T Johnstone and A M. Pitts, eds, London Mathematical Society Lecture Notes, pp 1-44 Cambridge University Press, 1992
10. G.L. Bum, The evaluation transformer model of reduction and its correctness In TAPSOFT '91. Number 494 in LNCS, pp 458-482 Springer-Veriag, 1991.
11. G L Bum, C L. Hanlon and S Abramsky, The theory and practice of strictness analysis for higher order functions Science of Computer Programming, 7, 249-278, 1986.
12. R Burs tall and J. Darlington, A transformation system for developing recursive programs. JACM, 24, 44-67, 1977
13. P Cousot and R Cousot, Constructive versions of Tarski’s fixed point theorems. Pacific Journal of Mathematics, 82, 43-57, 1979.
14. P Dybjer, Inverse image analysis generalises strictness analysis. Information and Computation, 90, 194-216, 1991
15. R. L Graham, D.E. Knuth, and O. Patashnik, Concrete Mathematics Addison-We& ey, 1989.
16. D. Gutt, Semantic Frameworks for Complexity. PhD thesis, Department of Computer Science, Edinburgh, 1991 (Available as reports CST-72-91 and ECS-LFCS-91-130)
17. T Hickey and J. Cohen, Automating program analysis JACM, 35, 185-220, 1988
18. D J. Howe, Equality m lazy computation systems In Fourth Annual Symposium on Logic In Computer Science, pp 198-203 IFFF, 1989
19. D.J. Howe, On computational open-endedness in Martin-LbFs type theory In Sixth Annual Symposium on Logic In Computer Science, pp. 162-172, 1991
20. D E. Knuth, Volume 1: Fundamental Algorithms The Art of Computer Programming Addison-We& ey, 1968
21. K. G Larsen, Context-Dependent Bisimulation Between Processes PhD thesis. Department of Computing, University of Edinburgh, 1986
22. D LeMdtayer, An automatic complexity evaluator ACM ToPLaS, 10(2) 248-266, April 1988 G. Lindstrom. Static evaluation of functional programs. In ACM SIGPLANSymposium on Compiler Construction, pp 196-206, 1986
23. I. Mason, The Semantics of Destructive Lisp. Number 5 in C& I Lecture Notes. C& I, 1986.
24. I Mason and C. Talcott, Equivalence in functional languages with effects. Journal of Functional Programming, 1, 287-327, 1991
25. R Milner, Calculi for synchrony and asynchrony Theoretical Computer Science, 25, 267-310, 1983.
26. R Milner and M Tofte, Co-mduction in relational semantics Theoretical Computer Science, 87, 209-220, 1991.
27. E Moggi, Computational lambda-calculus and monads Technical Report ECS-LFCS-88-63, Department of Computer Science, University of Edinburgh, 1988. (Short version in Fourth LICS Conf IEEE 1989)
28. H Luke Ong, The Lazy Lambda Calculus An Investigation into the Foundations of Functional Programming. PhD thesis, Imperial College, University of London, 1988
29. D. Park, Concurrency and automata on infinite sequences In 5th GI Conference on Theoretical Computer Science. LNCS 104, Springer Veriag, 1980.
30. S. L. Peyton Jones, The Implementation of Functional Programmmg Languages Prentice-Hall International Senes in Computer Science Prentice-Hall International (UK), London, 1987
31. A. Pitts, A co-induction principal for recursively defined domains Technical Report 252, University of Caro- bndge Computer Laboratory, April 1992
32. M Rosendahl, Automatic complexity analysis. In Functional Programmmg Languages and Computer Architecture, Conference Proceedmgs, pp. 144-156 ACM Press, 1989
33. D Sands, Complexity analysis for a higher order language Technical Report DOC 88/14, Imperial College, October 1988.
34. D. Sands, Complexity analysis for a lazy higher-order language. In Proceedmgs of the Glasgow Workshop on Functional Programmmg, Workshops in Computing Series, pp. 56-79.Springer Veriag, August 1989
35. D. Sands. Calculi for Time Analysis of Functional Programs. PhD thesis. Department of Computing, Imperial College, University of London, September 1990
36. D. Sands, Complexity analysis for a lazy higher-order language. In Proceedmgs of the Third European Symposium on Programmmg. Number 432 in LNCS, pp. 361-376. Springer-Veriag, May 1990
37. D. Sands, Operational theories of improvement in functional languages (extended abstract) In Proceedings of the Fourth Glasgow Workshop on Functional Programming, pp. 298-311, Skye, August 1991 Springer Workshop Senes
38. D. Sands, Time analysis, cost equivalence and program refinement. In Proceedings of the Eleventh Conference on Foundations of Software Technology and Theoretical Computer Science Number 560 m LNCS, pp. 25-39 Springer-Verlag, December 1991.
39. D. Sands, Total correctness and improvement in the transformation of functional programs. DIKU, University of Copenhagen, Unpublished (53 pages). May 1994
40. C. L. Talcott, The Essence of Rum, A Theory of the Intcnsional and Extensional Aspects of Lisp-type Computation PhD thesis, Stanford University, August 1985.
41. P Wadler, Strictness analysis aids time analysis In I5th ACM Symposium on Principals of Programming Languages, pp. 119-132, January 1988
42. P Wadler and R J M Hughes, Projections for strictness analysis. In 1987 Conference on Functional Programming and Computer Architecture, pp 385-407, Portland, Oregon, September 1987
43. B. Wegbreit, Mechanical program analysis CACM, 18, 528-539, 1975.