Specialising interpreters using offline partial deduction

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

Volumn 3049, Issue , 2004, Pages 340-375

  Leuschel, Michael ^a   Craig, Stephen J ^a   Bruynooghe, Maurice ^b   Vanhoof, Wim ^c  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c UNIVERSITY OF NAMUR   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34547157574     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25951-0_11     Document Type: Article

References (50)

1. L. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, May 1994. (DIKU report 94/19).
2. K. R. Apt and E. Marchiori. Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing, 6(6A):743-765, 1994.
3. K. R. Apt and F. Turini.Meta-logics and Logic Programming.MIT Press, 1995.
4. L. Birkedal and M. Welinder. Hand-writing program generator generators. In M. Hermenegildo and J. Penjam, editors, Programming Language Implementation and Logic Programming. Proceedings, Proceedings of PLILP'91, LNCS 844, pages 198-214, Madrid, Spain, 1994. Springer-Verlag.
5. A. F. Bowers and C. A. Gurr. Towards fast and declarative meta-programming. In K. R. Apt and F. Turini, editors, Meta-logics and Logic Programming, pages 137-166. MIT Press, 1995.
6. M. Bruynooghe, M. Leuschel, and K. Sagonas. A polyvariant binding-time analysis for off-line partial deduction. In C. Hankin, editor, Proceedings of the European Symposium on Programming (ESOP'98), LNCS 1381, pages 27-41. Springer-Verlag, April 1998.
7. Y. Cosmadopoulos, M. Sergot, and R. W. Southwick. Data-driven transformation of meta-interpreters: A sketch.In H. Boley and M. M. Richter, editors, Proceedings of the International Workshop on Processing Declarative Knowledge (PDK'91), volume 567 of LNAI, pages 301-308, Kaiserslautern, FRG, July 1991. Springer Verlag.
8. S. Craig and M. Leuschel. Lix: An effective self-applicable partial evaluator for Prolog.In Proceedings of FLOPS'04, April 2004.To appear.
9. A. De Niel, E. Bevers, and K. De Vlaminck. Partial evaluation of polymorphically typed functional languages: The representation problem. In M. Billaud and et al., editors, Analyse Statique en Programmation Equationelle, Fonctionelle, et Logique (Bigre, vol. 74), pages 90-97, October 1991.
10. Y. Futamura. Partial evaluation of a computation process -an approach to a compiler-compiler.Systems, Computers, Controls, 2(5):45-50, 1971.
11. J. Gallagher. Tutorial on specialisation of logic programs. In Proceedings of PEPM'93, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 88-98. ACM Press, 1993.
12. J- Gallagher and M. Bruynooghe. Some low-level transformations for logic programs. In M. Bniynooghe, editor, Proceedings of Meta90 Workshop on Meta Programming in Logic, pages 229-244, Leuven, Belgium, 1990.
13. R. Glück. Jones optimality, binding-time improvements, and the strength of program specializes. In Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation, pages 9-19. ACM Press, 2002.
14. R. Glück and J. Jørgensen. Efficient multi-level generating extensions for program specialization. In S. Swierstra and M. Hermenegildo, editors, Programming Languages, Implementations, Logics and Programs (PLILP'95), LNCS 982, pages 259-278, Utrecht, The Netherlands, September 1995. Springer-Verlag.
15. C. A. Gurr. A Self-Applicable Partial Evaluator for the Logic Programming Language Gödel. PhD thesis, Department of Computer Science, University of Bristol, January 1994.
16. P. Hill and J. Gallagher. Meta-programming in logic programming. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, pages 421-497. Oxford Science Publications, Oxford University Press, 1998.
17. C. K. Holst. Syntactic currying: yet another approach to partial evaluation. Technical report, DIKU, Department of Computer Science, University of Copenhagen, 1989.
18. C. K. Holst and J. Launchbury. Handwriting cogen to avoid problems with static typing.In Draft Proceedings, Fourth Annual Glasgow Workshop on Functional Programming, Skye, Scotland, pages 210-218. Glasgow University, 1991.
19. N. D. Jones. Partial evaluation, self-application and types. In M. S. Paterson, editor, Automata, Languages and Programming, LNCS 443, pages 639-659. Springer-Verlag, 1990.
20. N. D. Jones. What not to do when writing an interpreter for specialisation. In O. Danvy, R. Glück, and P. Thiemann, editors, Partial Evaluation, International Seminar, LNCS 1110, pages 216-237, Schloß Dagstuhl, 1996. Springer-Verlag.
21. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
22. N. D. Jones, P. Sestoft, and H. Søndergaard. An experiment in partial evaluation: The generation of a compiler generator. In J.-P. Jouannaud, editor, Rewriting Techniques and Applications, LNCS 202, pages 124-140, Dijon, France, 1985. Springer-Verlag.
23. 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.
24. J. Jorgensen and M. Leuschel. Efficiently generating efficient generating extensions in Prolog. In O. Danvy, R. Glück, and P. Thiemann, editors, Partial Evaluation, International Seminar, LNCS 1110, pages 238-262, Schloß Dagstuhl, 1996. Springer-Verlag.
25. J. Komorowski. An introduction to partial deduction. In A. Pettorossi, editor, Proceedings Meta'92, LNCS 649, pages 49-69. Springer-Verlag, 1992.
26. A. Lakhotia and L. Sterling. How to control unfolding when specializing interpreters. New Generation Computing, 8:61-70, 1990.
27. M. Leuschel. The ECCE partial deduction system and the DPPD library of benchmarks. Obtainable via http://www.ecs.soton.ac.uk/mal, 1996-2002.
28. M. Leuschel. Homeomorphic embedding for online termination of symbolic methods. In T. M. Mogensen, D. Schmidt, and I. H. Sudborough, editors, The. Essence of Computation - Essays dedicated to Neu Jones, LNCS 2756, pages 379-403. Springer-Verlag, 2002.
29. M. Leuschel and M. Bruynooghe. Logic program specialisation through partial deduction: Control issues. Theory and Practice of Logic Programming, 2 (4 & 5):461-515, July & September 2002.
30. M. Leuschel and M. Butler. ProB: A model checker for B. In K. Araki, S. Gnesi, and D. Mandrioli, editors, FME 2003: Formal Methods, LNCS 2805, pages 855-874. Springer-Verlag, 2003.
31. M. Leuschel, J. Jørgensen, W. Vanhoof, and M. Bruynooghe. Offline specialisation in Prolog using a hand-written compiler generator. Theory and Practice of Logic Programming, 4 (1):139-191, 2004.
32. M. Leuschel, B. Martens, and D. De Schreye. Controlling generalisation and polyvariance in partial deduction of normal logic programs. A CM Transactions on Programming Languages and Systems, 20 (1):208-258, January 1998.
33. M. Leuschel and M. H. Sørensen. Redundant argument filtering of logic programs. In J. Gallagher, editor, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'96, LNCS 1207, pages 83-103, Stockholm, Sweden, August 1996. Springer-Verlag.
34. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
35. J. W. Lloyd and R. W. Topor. Making Prolog more expressive. Journal of Logic Programming, 1 (3):225-240, 1984.
36. H. Makholm. On Jones-optimal specialization for strongly typed languages. In W. Taha, editor, Semantics, Applications, and Implementation of Program Generation, LNCS 1924, pages 129-148. Springer-Verlag, 2000.
37. B. Martens. On the Semantics of Meta-Programming and the Control of Partial Deduction in Logic Programming.PUD thesis, K.U. Leuven, February 1994.
38. B. Martens and J. Gallagher. Ensuring global termination of partial deduction while allowing flexible poly variance. In L. Sterling, editor, Proceedings ICLP'95, pages 597-613, Kanagawa, Japan, June 1995. MIT Press.
39. T. Mogensen and A. Bondorf.Logimix: A self-applicable partial evaluator for Prolog.In K.-K. Lau and T. Clement, editors, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'92, pages 214-227. Springer-Verlag, 1992.
40. T. Mogensen. Separating binding times in language specifications. In Proceedings of FPCA'89, pages 12-25. ACM press, 1989.
41. S. Prestwich.An unfold rule for full Prolog.In K.-K. Lau and T. Clement, editors, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'92, Workshops in Computing, pages 199-213, University of Manchester, 1992. Springer-Verlag.
42. S. Safra and E. Shapiro.Meta interpreters for real.In H.-J. Kugler, editor, Proceedings of IFIP'86, pages 271-278, 1986.
43. D. Sahlin. Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing, 12 (1):7-51, 1993.
44. L. Sterling and R. D. Beer. Metainterpreters for expert system construction. The Journal of Logic Programming, 6 (1 & 2):163-178, 1989.
45. L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986.
46. .W. Taha, H. Makholm, and J. Hughes. Tag elimination and Jones-optimality. In O. Danvy and A. Filinski, editors, Programs as Data Objects, Second Symposium, PADO 2001, LNCS 2053, pages 257-275, Aarhus, Denmark, May 2001. Springer-Verlag.
47. A. Takeuchi and K. Furukawa.Partial evaluation of Prolog programs and its application to meta programming. In H.-J. Kugler, editor, Information Processing 86, pages 415-420, 1986.
48. P. Thiemann. Cogen in six lines. In International Conference on Functional Programming, pages 180-189. ACM Press, 1996.
49. W. Vanhoof, M. Bruynooghe, and M. Leuschel. Binding-time analysis for Mercury. In M. Bruynooghe and K.-K. Lau, editors, Program Development in Computational Logic, LNCS this Volume. Springer-Verlag, 2004.
50. W. Vanhoof and B. Martens. To parse or not to parse. In N. Fuchs, editor, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'97, LNCS 1463, pages 322-342, Leuven, Belgium, July 1997.