Lazy rewriting on eager machinery

ACM Transactions on Programming Languages and Systems

Volumn 22, Issue 1, 2000, Pages 45-86

  Fokkink, Wan J ^a   Kamperman, Jasper F Th ^b   Walters, Pum ^c  

^a SWANSEA UNIVERSITY   (United Kingdom)

^b Reasoning Inc   (United States)

^c Babelfish   (Netherlands)

Author keywords

D.3.4 Programming Languages : Processors Compilers; Innermost reduction; Languages; Lazy rewriting; Optimization; Specificity ordering

Indexed keywords

FUNCTIONAL LANGUAGES; TERM-REWRITING SYSTEM (TRS);

DATA STRUCTURES; ENCODING (SYMBOLS); MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROGRAM COMPILERS; THEOREM PROVING; TREES (MATHEMATICS);

COMPUTER PROGRAMMING LANGUAGES;

EID: 0002988669     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/345099.345102     Document Type: Article

References (62)

1. AMTOFT, T. 1993. Minimal thunkification. In Proceedings, 3rd Workshop on Static Analysis, P. Cousot, M. Falaschi, G. Filè, and A. Rauzy, Eds. Lecture Notes in Computer Science, vol. 724. Springer-Verlag, Berlin, 218-229.
2. AUGUSTSSON, L. AND JOHNSSON, T. 1989. Parallel graph reduction with the 〈v, g〉-machine. In Proceedings, 5th Conference on Functional Programming Languages and Computer Architecture. ACM, New York, 202-213.
3. BAADER, F. AND NIPKOW, T. 1998. Term Rewriting and All That. Cambridge University Press, Cambridge, UK.
4. BAETEN, J. C. M., BERGSTRA, J. A., KLOP, J. W., AND WEIJLAND, W. P. 1989. Term-rewriting systems with rule priorities. Theor. Comput. Sci. 67, 2/3, 283-301.
5. BAILEY, S. W. 1995. Hielp, a fast interactive lazy functional language system. Ph.D. thesis, University of Chicago, Chicago. Available at http://www.cs.uchicago.edu/tech-reports/.
6. BARENDREGT, H. P., VAN EEKELEN, M. C. J. D., GLAUERT, J. R. W., KENNAWAY, J. R., PLASMEIJER, M. J., AND SLEEP, M. R. 1987. Term graph rewriting. In Proceedings, 1st Conference on Parallel Architectures and Languages Europe, J. W. de Bakker, A. J. Nijman, and P. C. Treleaven, Eds. Lecture Notes in Computer Science, vol. 259. Springer-Verlag, Berlin, 141-158.
7. BRUS, T., VAN EEKELEN, M. C. J. D., VAN LEER, M., PLASMEIJER, M. J., AND BARENDREGT, H. P. 1987. Clean - a language for functional graph rewriting. In Proceedings, 3rd Conference on Functional Programming Languages and Computer Architecture, G. Kahn, Ed. Lecture Notes in Computer Science, vol. 274. Springer-Verlag, Berlin, 364-384.
8. BURN, G. 1991. Lazy Functional Languages: Abstract Interpretation and Compilation. Research Monographs in Parallel and Distributed Computing. Pitman, London.
9. CHEW, L. P. 1980. An improved algorithm for computing with equations. In Proceedings, 21st IEEE Symposium on Foundations of Computer Science. IEEE, 108-117.
10. COUSINEAU, G., CURIEN, P.-L., AND MAUNY, M. 1987. The categorical abstract machine. Sci. Comput. Program. 8, 2, 173-202.
11. DURAND, I. 1994. Bounded, strongly sequential and forward-branching term rewriting systems. Journal of Symbolic Computation 18, 4, 319-352.
12. DURAND, I. AND SALINIER, B. 1993. Constructor equivalent term rewriting systems. Inf. Process. Lett. 47, 3, 131-137.
13. FOKKINK, W. J., KAMPERMAN, J. F. T., AND WALTERS, H. R. 1998. Within ARM's reach: compilation of left-linear rewrite systems via minimal rewrite systems. ACM Trans. Program. Lang. Syst. 20, 3, 679-706.
14. FOKKINK, W. J. AND VAN DE POL, J. C. 1997. Simulation as a correct transformation of rewrite systems. In Proceedings, 22nd Symposium on Mathematical Foundations of Computer Science, I. Prívara and P. Ružička, Eds. Lecture Notes in Computer Science, vol. 1295. Springer-Verlag, Berlin, 249-258.
15. FRIEDMAN, D. P. AND WISE, D. S. 1976. CONS should not evaluate its arguments. In Proceedings, 3rd Colloquium on Automata, Languages and Programming, S. Michaelson and R. Milner, Eds. Edinburgh University Press, Edinburgh, 257-284.
16. GIESL, J. AND MIDDELDORP, A. 1999. Transforming context-sensitive rewrite systems. In Proceedings, 10th Conference on Rewriting Techniques and Applications, P. Narendran and M. Rusinowitch, Eds. Lecture Notes in Computer Science, vol. 1632. Springer-Verlag, Berlin, 271-285.
17. GOGUEN, J. A., WINKLER, T., MESEGUER, J., FUTATSUGI, K., AND JOUANNAUD, J.-P. 1993. Applications of Algebraic Specifications using OBJ. Cambridge University Press, Cambridge, UK.
18. GRÄF, A. 1991. Left-to-right tree pattern matching. In Proceedings, 4th Conference on Rewriting Techniques and Applications, R. V. Book, Ed. Lecture Notes in Computer Science, vol. 488. Springer-Verlag, Berlin, 323-334.
19. HARTEL, P. H., FEELEY, M., ALT, M., AUGUSTSSON, L., BAUMANN, P., BEEMSTER, M., CHAILLOUX, E., FLOOD, C. H., GRIESKAMP, W., VAN GRONINGEN, J. H. G., HAMMOND, K., HAUSMAN, B., IVORY, M. Y., JONES, R. E., KAMPERMAN, J. F. T., LEE, P., LEROY, X., LINS, R. D., LOOSEMORE, S., RJEMO, N., SERRANO, M., TALPIN, J.-P., THACKRAY, J., THOMAS, S., WALTERS, H. R., WEIS, P., AND WENTWORTH, P. 1996. Benchmarking implementations of functional languages with "pseudoknot", a float-intensive benchmark. J. Funct. Program. 6, 4, 621-655.
20. HENDERSON, P. AND MORRIS, J. H. 1976. A lazy evaluator. In Conference Record of the 3rd ACM Symposium on Principles of Programming Languages. ACM, New York, 95-103.
21. HOFFMANN, C. M. AND O'DONNELL, M. J. 1982a. Pattern matching in trees. J. ACM 29, 1, 68-95.
22. HOFFMANN, C. M. AND O'DONNELL, M. J. 1982b. Programming with equations. ACM Trans. Program. Lang. Syst. 4, 1, 83-112.
23. HUET, G. AND LÉVY, J.-J. 1991. Computations in orthogonal rewriting systems, parts i and ii. In Computational Logic: Essays in Honor of Alan Robinson, J.-L. Lassez and G. Plotkin, Eds. MIT Press, Cambridge, Mass., 395-443.
24. INGERMAN, P. Z. 1961. Thunks: a way of compiling procedure statements with some comments on procedure declarations. Commun. ACM 4, 1, 55-58.
25. JOHNSSON, T. 1984. Efficient compilation of lazy evaluation. In Proceedings, ACM Symposium on Compiler Construction. ACM SIGPLAN Not. 19, 6, 58-69.
26. JONES, M. P. 1994. The implementation of the Gofer functional programming system. Tech. Rep. YALEU/DCS/RR-1030, Yale University, New Haven. Available at http://www.cse.ogi.edu/ mpj/pubs/goferimp.html.
27. KAMPERMAN, J. F. T. 1996. Compilation of term rewriting systems. Ph.D. thesis, University of Amsterdam, Amsterdam. Available at http://www.babelfish.nl.
28. KAMPERMAN, J. F. T. AND WALTERS, H. R. 1995. Lazy rewriting on eager machinery. In Proceedings, 6th Conference on Rewriting Techniques and Applications, J. Hsiang, Ed. Lecture Notes in Computer Science, vol. 914. Springer-Verlag, Berlin, 147-162.
29. KAMPERMAN, J. F. T. AND WALTERS, H. R. 1996. Minimal term rewriting systems. In Proceedings, 11th Workshop on Specification of Abstract Data Types, M. Haveraaen, O. Owe, and O.-J. Dahl, Eds. Lecture Notes in Computer Science, vol. 1130. Springer-Verlag, Berlin, 274-290.
30. KENNAWAY, J. R. 1990. The specificity rule for lazy pattern-matching in ambiguous term rewrite systems. In Proceedings, 3rd European Symposium on Programming, N. D. Jones, Ed. Lecture Notes in Computer Science, vol. 432. Springer-Verlag, Berlin, 256-270.
31. KENNAWAY, J. R., KLOP, J. W., SLEEP, M. R., AND DE VRIES, F. J. 1994. On the adequacy of graph rewriting for simulating term rewriting. ACM Trans. Program. Lang. Syst. 16, 3, 493-523.
32. LUCAS, S. 1995. Fundamentals of context-sensitive rewriting. In Proceedings, 22nd Seminar on Current Trends in Theory and Practice of Informatics, M. Bartosek, J. Staudek, and J. Wiedermann, Eds. Lecture Notes in Computer Science, vol. 1012. Springer-Verlag, Berlin, 405-412.
33. LUTTIK, S. P., RODENBURG, P. H., AND VERMA, R. M. 1996. Correctness criteria for transformations of rewrite systems with an application to Thatte's transformation. Technical Report P9615, University of Amsterdam, Amsterdam.
34. MYCROFT, A. 1980. The theory and practice of transforming call-by-need into call-by-value. In Proceedings, 4th Symposium on Programming, B. Robinet, Ed. Lecture Notes in Computer Science, vol. 83. Springer-Verlag, Berlin, 269-281.
35. NELSON, G. AND OPPEN, D. C. 1980. Fast decision procedures based on congruence closure. J. ACM 27, 2, 356-364.
36. O'DONNELL, M. J. 1977. Computing in Systems Described by Equations. Lecture Notes in Computer Science, vol. 58. Springer-Verlag, Berlin.
37. O'DONNELL, M. J. 1985. Equational Logic as a Programming Language. MIT Press, Cambridge, Mass.
38. O'DONNELL, M. J. 1998. Introduction: logic and logic programming languages. In Handbook of Logic in Artificial Intelligence and Logic Programming, D. M. Gabbay, Ed. Vol. 5. Oxford University Press, New York, 1-67.
39. OGATA, K. AND FUTATSUGI, K. 1997. Implementation of term rewritings with the evaluation strategy. In Proceedings, 9th Symposium on Programming Languages: Implementations, Logics, and Programs, H. Glaser, P. H. Hartel, and H. Kuchen, Eds. Lecture Notes in Computer Science, vol. 1292. Springer-Verlag, Berlin, 225-239.
40. OKASAKI, C., LEE, P., AND TARDITI, D. 1994. Call-by-need and continuation-passing style. Lisp and Symbolic Computation 7, 1, 57-81.
41. PEYTON JONES, S. L. 1987. The Implementation of Functional Programming Languages. Prentice-Hall, Englewood Cliffs, N.J.
42. PEYTON JONES, S. L. AND SALKILD, J. 1989. The spineless tagless G-machine. In Proceedings, 4th Conference on Functional Programming Languages and Computer Architecture, D. B. Mac-Queen, Ed. Addison-Wesley, Reading, Mass., 184-201.
43. PLASMEIJER, M. J. August 1998. Personal communication.
44. PLASMEIJER, M. J. AND VAN EEKELEN, M. C. J. D. 1993. Functional Programming and Parallel Graph Rewriting. Addison-Wesley, Reading, Mass.
45. PLOTKIN, G. D. 1975. Call-by-name, call-by-value and the λ-calculus. Theor. Comput. Sci. 1, 1, 125-159.
46. 3 report on the algorithmic language Scheme. ACM SIGPLAN Not. 21, 12, 37-79.
47. SALINIER, B. AND STRANDH, R. I. 1996. Efficient simulation of forward-branching systems with constructor systems. Journal of Symbolic Computation 22, 4, 381-399.
48. SEKAR, R., RAMAKRISHNAN, I. V., AND MISHRA, P. 1997. On the power and limitations of strictness analysis. J. ACM 44, 3, 505-525.
49. SHERMAN, D., STRANDH, R. I., AND DURAND, I. 1991. Optimization of equational programs using partial evaluation. In Proceedings, 1st Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM SIGPLAN Not. 26, 9, 72-82.
50. STAPLES, J. 1980. Computation on graph-like expressions. Theor. Comput. Sci. 10, 2, 171-185.
51. STECKLER, P. AND WAND, M. 1994. Selective thunkification. In Proceedings, 1st Symposium on Static Analysis, B. L. Charlier, Ed. Lecture Notes in Computer Science, vol. 864. Springer-Verlag, Berlin, 162-178.
52. STRANDH, R. I. 1987. Optimizing equational programs. In Proceedings, 2nd Conference on Rewriting Techniques and Applications, P. Lescanne, Ed. Lecture Notes in Computer Science, vol. 256. Springer-Verlag, Berlin, 13-24.
53. STRANDH, R. I. 1988. Compiling equational programs into efficient machine code. Ph.D. thesis, Johns Hopkins University.
54. STRANDH, R. I. 1989. Classes of equational programs that compile efficiently into machine code. In Proceedings, 3rd Conference on Rewriting Techniques and Applications, N. Dershowitz, Ed. Lecture Notes in Computer Science, vol. 355. Springer-Verlag, Berlin, 449-461.
55. THATTE, S. R. 1985. On the correspondence between two classes of reduction systems. Inf. Process. Lett. 20, 2, 83-85.
56. THATTE, S. R. 1988. Implementing first-order rewriting with constructor systems. Theor. Comput. Sci. 61, 1, 83-92.
57. TURNER, D. A. 1979. A new implementation technique for applicative languages. Softw. Pract. Exper. 9, 1, 31-49.
58. VERMA, R. M. 1995. Transformations and confluence for rewrite systems. Theor. Comput. Sci. 152, 2, 269-283.
59. WALTERS, H. R. 1997. Epic and ARM - user's guide. Technical Report SEN-R9724, CWI, Amsterdam. Report and tool set available at http://www.babelfish.nl.
60. WALTERS, H. R. AND KAMPERMAN, J. F. T. 1996. EPIC: An equational language - abstract machine and supporting tools. In Proceedings, 7th Conference on Rewriting Techniques and Applications, H. Ganzinger, Ed. Lecture Notes in Computer Science, vol. 1103. Springer-Verlag, Berlin, 424-427.
61. WILSON, P. R. 1992. Uniprocessor garbage collection techniques. In Proceedings, 1st Workshop on Memory Management, Y. Bekkers and J. Cohen, Eds. Lecture Notes in Computer Science, vol. 637. Springer-Verlag, Berlin, 1-42.
62. WRAY, S. C. AND FAIRBAIRN, J. 1989. Non-strict languages - programming and implementation. Comput. J. 33, 2, 142-151.