Driving in the jungle

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

Volumn 2053 LNCS, Issue , 2001, Pages 198-217

  Secher, Jens Peter ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENCY; SEMANTICS;

CALL-BY-NAME; CALL-BY-NEED; CONSTANT FACTORS; EVALUATION STRATEGIES; FUNCTIONAL PROGRAMS; LINEAR SPEED-UP; SPIN OFF; TRANSFORMATION TECHNIQUES;

PROGRAM COMPILERS;

EID: 38049138169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44978-7_12     Document Type: Conference Paper

References (22)

1. R.M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the Association for Computing Machines, 24(1):44-67, 1977.
2. Wei-Ngan Chin. Towards an automated tupling strategy. In Proceeding of the ACM SIG PLAN Syposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 119-132, Copenhagen, Denmark, 14-16 June 1993. ACM Press.
3. D. De Schreye, R. Glück, J. Jørgensen, M. Leuschel, B. Martens, and M. H. Sørensen. Conjunctive partial deduction: Foundations, control, algorithms, and experiments. Journal of Logic Programming, 41(2-3):231-277, 1999.
4. J. Gallagher. Tutorial in specialisation of logic programs. In Proceeding of the ACM SIG PLAN Syposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 88-98. ACM Press, 1993.
5. R. Glück and A.V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot, M. Falaschi, G. Filè, and G. Rauzy, editors, Workshop on Static Analysis, Volume 724 of Lecture Notes in Computer Science, pages 112-123. Springer-Verlag, 1993.
6. Annegret Habel, Hans-Jörg Kreowski, and Detlef Plump. Jungle evaluation. Fun - damenta Informaticae, XV:37-60, 1991.
7. Berthold Hoffmann and Detlef Plump. Implementing term rewriting by jungle evaluation. RAIRO Theoretical Informatics and Applications, 25(5):445-472, 1991.
8. N.D. Jones, P. Sestoft, and H. Søndergaard. Mix: a self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1):9-50, 1989.
9. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
10. Michael Leuschel. On the power of homeomorphic embedding for online termination. In Georgio Levi, editor, Static Analysis. Proceedings, Volume 1503 of Lecture Notes in Computer Science, pages 230-245, Pisa, Italy, September 1998. Springer-Verlag.
11. A. Pettorossi, E. Pietropoli, and M. Proietti. The use of the tupling strategy in the development of parallel programs. In R. Paige, J. Reif, and R. Wachter, editors, Parallel Algorithm Derivation and Program Transformation, pages 111-151. Kluwer Academic Publishers, 1993.
12. Alberto Pettorossi. A powerful strategy for deriving efficient programs by transformation. In Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming, pages 273-281. ACM, ACM, August 1984.
13. Gordon D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, September 1981.
14. M.H. Sørensen and R. Glück. An algorithm of generalization in positive super-compilation. In J.W. Lloyd, editor, Logic Programming: Proceedings of the 1995 International Symposium, pages 465-479. MIT Press, 1995.
15. M.H. Sørensen, R. Glück, and N.D. Jones. A positive supercompiler. Journal of Functional Programming, 6(6):811-838, 1996.
16. Morten Heine Sørensen and Robert Glück. Introduction to supercompilation. In John Hatcliff, Torben Mogensen, and Peter Thiemann, editors, Partial Evaluation: Practice and Theory, Volume 1706 of Lecture Notes in Computer Science, pages 246-270. Springer-Verlag, 1999.
17. Morten Heine B. Sørensen. Convergence of program transformers in the metric space of trees. Science of Computer Programming, 37(1-3):163-205, May 2000.
18. V. F. Turchin. The algorithm of generalization in the supercompiler. In D. Bjørner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 531-549, Amsterdam: North-Holland, 1988. Elsevier Science Publishers B.V.
19. V.F. Turchin. The concept of a supercompiler. ACM Transactions on Programming Languages and Systems, 8(3):292-325, 1986.
20. V.F. Turchin and A.P. Nemytykh. A self-applicable supercompiler. Technical Report CSc. TR 95-010, City College of the City University of New York, 1995.
21. P.L. Wadler. Deforestation: Transforming programs to eliminate intermediate trees. Theoretical Co mputer S cience, 73:231-248, 1990.
22. Christopher Peter Wadsworth. Semantics and pragmatics of the lambda calculus. Ph.D. thesis, Programming Research Group, Oxford University, September 1971.