Formally Based Profiling for Higher-Order Functional Languages

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 2, 1997, Pages 334-385

  Sansom, Patrick M ^a   Peyton Jones, Simon L ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

D.2.5 Software Engineering : Testing and Debugging debugging aids; D.3.2 Programming Languages : Language Classifications applicative languages; D.3.4 Programming Languages : Processors compilers; Optimization

Indexed keywords

COMPUTATIONAL LINGUISTICS; COSTS; HIGH LEVEL LANGUAGES; OPTIMIZATION; PROGRAM DEBUGGING;

PROGRAM TRANSFORMATIONS; SOURCE LEVEL PROFILER;

PROGRAM COMPILERS;

EID: 0031099099     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/244795.244802     Document Type: Article

References (28)

1. APPEL, A. W., DUBA, B. F., AND MACQUEEN, D. B. 1988. Profiling in the presence of optimization and garbage collection. Tech. Rep. CS-TR-197-88, Dept. of Computer Science, Princeton Univ., Princeton, N.J.
2. AUGUSTSSON, L. 1993. Implementing Haskell overloading. In the Conference on Functional Programming Languages and Computer Architecture. ACM, New York, 65-73.
3. AUGUSTSSON, L. AND JOHNSSON, T. 1989. The Chalmers Lazy-ML compiler. Comput. J. 32, 2, 127-141.
4. BENTLEY, J. L. 1982. Writing Efficient Programs. Prentice-Hall, Englewood Cliffs, N.J.
5. CLACK, C., CLAYMAN, S., AND PARROTT, D. 1995. Lexical profiling: Theory and practice. J. Funct. Program. 5, 2, 225-277.
6. FAIRBAIRN, J. AND WRAY, S. 1987. TIM - A simple lazy abstract machine to execute super-combinators. In the Proceedings of the IFIP Conference on Functional Programming Languages and Computer Architecture, G. Kahn, Ed.,Lecture Notes in Computer Science, vol. 274. Springer-Verlag, Berlin, 34-45.
7. GRAHAM, S. L., KESSLER, P. B., AND MCKUSICK, M. K. 1983. An execution profiler for modular programs. Softw. Pract. Exper. 13, 8, 671-685.
8. HALL, C. V., HAMMOND, K., PEYTON JONES, S. L., AND WADLER, P. L. 1994. Type classes in Haskell. In the European Symposium on Programming (ESOP'94), D. Sannella, Ed.,Lecture Notes in Computer Science, vol. 788. Springer-Verlag, Berlin, 241-256.
9. HUDAK, P., PEYTON JONES, S. L., WADLER, P. L., ARVIND, BOUTEL, B., FAIRBAIRN, J., FASEL, J., GUZMAN, M., HAMMOND, K., HUGHES, J., JOHNSSON, T., KIEBURTZ, R., NIKHIL, R. S., PARTAIN, W., AND PETERSON, J. 1992. Report on the functional programming language Haskell, Version 1.2. ACM SIGPLAN Not. 27, 5.
10. BUTTON, G. 1992. Higher-order functions for parsing. J. Funct. Program. 2, 3, 323-343.
11. INGALLS, D. 1972. The execution profile as a measurement tool. In Design and Optimization of Compilers, R. Rustin, Ed. Prentice-Hall, Englewood Cliffs, N.J., 107-128.
12. JONES, M. P. 1992. Efficient implementation of type class overloading. Dept. of Computer Science, Oxford Univ., Oxford, U.K.
13. KNUTH, D. E. 1971. An Empirical Study of FORTRAN Programs. Softw. Pract. Exper. 1, 105-133.
14. KOZATO, Y. AND OTTO, G. P. 1993. Benchmarking real-life image processing programs in lazy functional languages. In the Conference on Functional Programming Languages and Computer Architecture. ACM, New York, 18-27.
15. LAUNCHBURY, J. 1993. A natural semantics for lazy evaluation. In the 20th ACM Symposium on the Principles of Programming Languages. ACM, New York, 144-154.
16. MORGAN, R. G. AND JARVIS, S. A. 1995. Profiling large-scale lazy functional programs. In the Proceedings of the High Performance Functional Computing Workshop, A. P. Wim Bohm and J. T. Feo, Eds. Lawrence Livermore National Laboratory, Livermore, Calif., 222-234.
17. MORGAN, R. G., GARIGLIANO, R., JARVIS, S. A., AND PARKER, B. S. 1994. Maintenance and development of large scale lazy functional programs. In the Dagstuhl Workshop on Functional Programming in the Real World. Dagstuhl, Saarbrücken, Germany.
18. PARTAIN, W. D. 1993. The nofib benchmark suite of Haskell programs. In Functional Programming, Glasgow 1992, J. Launchbury and P. M. Sansom, Eds.,Workshops in Computing. Springer-Verlag, Berlin, 195-202.
19. PEYTON JONES, S. L. 1992. Implementing lazy functional languages on stock hardware: The Spineless Tagless G-machine. J. Funct. Program. 2, 2, 127-202.
20. PEYTON JONES, S. L., HALL, C. V., HAMMOND, K., PARTAIN, W. D., AND WADLER, P. L. 1993. The Glasgow Haskell compiler: A technical overview. In the Joint Framework for Information Technology (JFIT) Technical Conference Digest. SERC, Swindon, U.K., 249-257.
21. RÖJEMO, N. 1995. Garbage collection and memory efficiency in lazy functional languages. Ph.D. thesis, Dept. of Computing Science, Chalmers Univ., Chalmers, Sweden.
22. RÖJEMO, N. AND RUNCIMAN, C. 1996. Lag, drag, void, and use: Heap profiling and space-efficient compilation revisited. In the International Conference on Functional Programming. ACM, New York, 34-41.
23. RUNCIMAN, C. AND RÖJEMO, N. 1996. New dimensions in heap profiling. J. Funct. Program. 6, 4, 587-620.
24. RUNCIMAN, C. AND WAKELING, D. 1993. Heap profiling of lazy functional programs. J. Funct. Program. 3, 2, 217-245.
25. SANSOM, P. M. 1994. Time profiling a lazy functional compiler. In Functional Programming, Glasgow 1993, K. Hammond and J. O'Donnell, Eds.,Workshops in Computing. Springer-Verlag, Berlin, 252-264.
26. SANTOS, A. 1995. Compilation by transformation in non-strict functional languages. Ph.D. thesis, Res. Rep. FP-1995-17, Dept. of Computing Science, Univ. of Glasgow, Scotland.
27. SESTOFT, P. 1997. Deriving a lazy abstract machine. J. Funct. Program. 7, 3. To be published.
28. WADLER, P. L. AND BLOTT, S. 1989. How to make ad-hoc polymorphism less ad hoc. In the 16th ACM Symposium on the Principles of Programming Languages. ACM, New York.