Generalization in hierarchies of online program specialization systems

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

Volumn 1559, Issue , 1998, Pages 179-198

  Glück, Robert ^a   Hatcliff, John ^b   Jørgensen, Jesper ^c  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b Sunflower Networking Group   (United States)

^c UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; LOGIC PROGRAMMING; SYNTHESIS (CHEMICAL);

ENCODINGS; FUNCTIONAL LANGUAGES; HOMEOMORPHIC EMBEDDING; INITIAL DESIGN; META PROGRAMMING; ONLINE PROGRAMS; S-GRAPH; TERMINATION STRATEGY;

ONLINE SYSTEMS;

EID: 84887860589     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (29)

1. S.M. Abramov. Metacomputation and program testing. In 1st International Workshop on Automated and Algorithmic Debugging, pages 121-135, Linkoping University, Sweden, 1993.
2. M. Alpuente, M. Falaschi, and G. Vidal. Narrowing-driven partial evaluation of functional logic programs. In H.R. Nielson, editor, European Symposium on Programming, Lecture Notes in Computer Science, pages 46-61. Springer-Verlag, 1996.
3. K. Apt and F. Turini Meta-Logics and Logic Programming, MIT Press, 1995.
4. J. Barklund. A basis for a multilevel metalogic programming language. Technical Report 81, Uppsala University, Dept, of Computing Science, 1994.
5. R. Bol. Loop checking in partial deduction. J of Logic Programming, 16(1&2):25-46, 1993.
6. S. Costantini and G. Lanzarone. A metalogic programming language. In G. Levi and M. Martelli, editors, Proceedings Sixth International Conference on Logic Programming, pages 218-233. MIT Press, 1989.
7. O. Danvy, R. Gluck, and P. Thiemann, editors. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
8. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 244-320. Elsevier, 1992.
9. U. Eisenecker. Generative programming with C++. In H. Mössenböck, editor, Modular Programming Languages, volume 1204 of Lecture Notes in Computer Science, pages 351-365. Springer-Verlag, 1997.
10. R. Glück. On the mechanics of metasystem hierarchies in program transformation. In M. Proietti, editor, Logic Program Synthesis and Transformation (LOPSTR‘95), volume 1048 of Lecture Notes in Computer Science, pages 234-251. Springer- Verlag, 1996.
11. R. Glück and J. Jørgensen. An automatic program generator for multi-level specialization. Lisp and Symbolic Computation, 10(2): 113-158, 1997.
12. R. Glück and A.V. Klimov. Occam’s razor in metacomputation: the notion of a perfect process tree. In P. Cousot, et al., editors, Static Analysis. Proceedings. Lecture Notes in Computer Science, Vol. 724, pages 112-123. Springer-Verlag, 1993.
13. J. Hatcliff and R. Glück. Reasoning about hierarchies of online specialization systems. In Danvy et al. [7].
14. P. Hill and J. Gallagher. Meta-programming in logic programming. Technical Report 94.22, School of Computer Studies, University of Leeds, 1994.
15. P. Hill and J.W. Lloyd. The Godel Programming Language. MIT Press, 1994.
16. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
17. M. Leuschel. Homeomorphic embedding for online termination. Technical Report DSSE-TR-98-11, University of Southampton, Dept, of Electronics and Computer Science, 1998.
18. M. Leuschel. On the power of homeomorphic embedding for online termination. G. Levi, editor, Static Analysis. Proceedings. Lecture Notes in Computer Science, Vol. 1503, pages 230-245, Springer-Verlag 1998.
19. M. Leuschel and B. Martens. Global control for partial deduction through characteristic atoms and global trees. In Danvy et al. [7], pages 263-283.
20. G. Nadathur and D. Miller. Higher-Order Logic Programming. In Handbook of Logic in AI and Logic Programming, Vol. 5, pages 499-590, Oxford University Press, 1998.
21. A. Pettorossi, M. Proietti. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming, 19 & 20:261-320, 1994.
22. M.H. Sørensen and R. Glück. An algorithm of generalization in positive supercompilation. In J.W. Lloyd, editor, Logic Programming: Proceedings of the 1995 International Symposium, pages 465-479. MIT Press, 1995.
23. L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986.
24. W. Taha and T. Sheard. Multi-stage programming with explicit annotations. In Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 203-217, 1997.
25. V.F. Turchin. The concept of a supercompiler. Transactions on Programming Languages and Systems, 8(3):292-325, 1986.
26. V.F. Turchin. Metacomputation: metasystem transitions plus supercompilation. In Danvy et al. [7].
27. V.F. Turchin. On generalization of lists and strings in supercompilation. Technical Report CSc. TR 96-002, City College of the City University of New York, 1996.
28. V.F. Turchin and A.P. Nemytykh. Metavariables: their implementation and use in program transformation. CSc. TR 95-012, City College of the City University of New York, 1995.
29. W. Vanhoof and B. Martens. To parse or not to parse. In N. Fuchs (ed.), Logic Program Synthesis and Transformation (LOPSTR’97), Lecture Notes in Computer Science, Vol. 1463, pages 314-333, Springer-Verlag 1998.