To parse or not to parse

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

Volumn 1463, Issue , 1998, Pages 322-342

  Vanhoof, Wim ^a   Martens, Bern ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; COMPUTER CIRCUITS; FORMAL LOGIC; LOGIC PROGRAMMING;

AD HOC APPROACH; CONCRETE APPLICATIONS; CONTROL STRATEGIES; HOMEOMORPHIC EMBEDDING; META-INTERPRETERS; PARSING PROBLEMS; PARTIAL DEDUCTION; SPECIALISATION;

PROGRAM INTERPRETERS;

EID: 84947967110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49674-2_17     Document Type: Conference Paper

References (33)

1. J. Barklund. Metaprogramming in logic. In A. Kent and J.G. Williams, editors, Encyclopedia of Computer Science and Technology, Vol. 33, pages 205-227. Marcell Dekker, Inc., New York, 1995.
2. 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.
3. A. Brogi and S. Contiero. Gödel as a meta language for composing logic programs. In A. Turini, editor, Proceedings Meta’94, pages 377-394. University of Pisa, 1994.
4. A. Brogi and S. Contiero. A program specialiser for meta-level compositions of logic programs. Technical Report TR-96-20, Dipartimento di Informatica, Universita di Pisa, Pisa, Italy, May 1996.
5. A. Brogi and S. Contiero. Specialising meta-level compositions of logic programs. In J. Gallagher, editor, Proceedings LOPSTR '96, pages 275-294, Stockholm, 1997. Springer-Verlag, LNCS 1207.
6. A. Brogi, P. Mancarella, D. Pedreschi, and F. Turini. Composition operators for logic theories. In J. W. Lloyd, editor, Proceedings of the Esprit Symposium on Computational Logic, pages 117-134. Springer-Verlag, November 1990.
7. A. Brogi, P. Mancarella, D. Pedreschi, and F. Turini. Meta for modularising logic programming. In A. Pettorossi, editor, Proceedings Meta’92, pages 105-119. Springer-Verlag, LNCS 649, 1992.
8. D. De Schreye, M. Leuschel, and B. Martens. Tutorial on program specialisation (abstract). In J.W. Lloyd, editor, Proceedings ILPS’95, pages 615-616, Portland, Oregon, December 1995. MIT Press.
9. J. Gallagher. Transforming logic programs by specialising interpreters. In Proceedings ECAI’86, pages 109-122, 1986.
10. J. Gallagher. Specialisation of logic programs: A tutorial. In Proceedings PEPM’93, ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 88-98, Copenhagen, June 1993. ACM Press.
11. R. Glück, J. Jørgensen, B. Martens, and M. H. Sørensen. Controlling conjunctive partial deduction of definite logic programs. In H. Kuchen and S.D. Swierstra, editors, Proceedings PLILP’96, pages 152-166, Aachen, Germany, September 1996. Springer-Verlag, LNCS 1140.
12. P. M. Hill and J. Gallagher. Meta-programming in logic programming. Technical Report 94.22, School of Computer Studies, University of Leeds, U.K., August 1994. To appear in Volume V of the Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press.
13. P. M. Hill and J. W. Lloyd. Analysis of meta-programs. In H. D. Abramson and M. H. Rogers, editors, Proceedings Meta’88, pages 23-51. MIT Press, 1989.
14. J. Jørgensen, M. Leuschel, and B. Martens. Conjunctive partial deduction in practice. In J. Gallagher, editor, Proceedings LOPSTR '96, pages 59-82, Stockholm, August 1997. Springer-Verlag, LNCS 1207. Shorter and preliminary version in Proceedings of Benelog’96.
15. A. Lakhotia. To PE or not to PE. In M. Bruynooghe, editor, Proceedings Meta '90, pages 218-228, Leuven, April 1990.
16. A. Lakhotia and L. Sterling. How to control unfolding when specializing interpreters. New Generation Computing, 8(1):61-70, 1990.
17. M. Leuschel, D. De Schreye, and A. de Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration. In M. Maher, editor, Proceedings JICSLP’96, pages 319-332, Bonn, Germany, September 1996. MIT Press.
18. M. Leuschel and B. Martens. Global control for partial deduction through characteristic atoms and global trees. In O. Danvy, R. Glück, and P. Thiemann, editors, Proceedings Dagstuhl Seminar on Partial Evaluation, pages 263-283, Schloss Dagstuhl, Germany, 1996. Springer-Verlag, LNCS 1110.
19. M. Leuschel, B. Martens, and D. De Schreye. Controlling generalisation and polyvariance in partial deduction of normal logic programs. ACM Transactions on Programming Languages and Systems. To Appear. Preliminary version as Technical Report CW248, Departement Computerwetenschappen, K.U. Leuven, February 1997, Belgium. See http://www.cs.kuleuven.ac.be/publicaties/rapporten/CW1997.html.
20. Michael Leuschel. Ecological partial deduction: Preserving characteristic trees without constraints. In Maurizio Proietti, editor, Logic Program Synthesis and Transformation. Proceedings of LOPSTR '95, LNCS 1048, pages 1-16, Utrecht, The Netherlands, September 1995. Springer-Verlag.
21. Michael Leuschel. The ECCE partial deduction system and the DPPD library of benchmarks. Obtainable via http://www.cs.kuleuven.ac.be/~lpai, 1996.
22. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. Journal of Logic Programming, 11(3&4):217-242, 1991.
23. B. Martens. On the Semantics of Meta-Programming and the Control of Partial Deduction in Logic Programming. PhD thesis, Departement Computerwetenschappen, K.U. Leuven, Belgium, February 1994.
24. B. Martens and D. De Schreye. Why untyped non-ground meta-programming is not (much of) a problem. Journal of Logic Programming, 22(1):47-99, 1995.
25. B. Martens and D. De Schreye. Automatic finite unfolding using well-founded measures. Journal of Logic Programming, 28(2):89-146, 1996.
26. B. Martens and J. Gallagher. Ensuring global termination of partial deduction while allowing flexible polyvariance. In L. Sterling, editor, Proceedings ICLP’95, pages 597-611, Shonan Village Center, Kanagawa, Japan, June 1995. MIT Press.
27. S. Owen. Issues in the partial evaluation of meta-interpreters. In H. D. Abramson and M. H. Rogers, editors, Proceedings Meta’88, pages 319-339. MIT Press, 1989.
28. S. Safra and E. Shapiro. Meta interpreters for real. In H.-J. Kugler, editor, Information Processing 86, pages 271-278, 1986.
29. D. Sahlin. Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing, 12(1):7-51, 1993.
30. M. H. Sørensen and R. Glück. An algorithm of generalization in positive supercompilation. In J.W. Lloyd, editor, Proceedings ILPS’95, pages 465-479, Portland, Oregon, December 1995. MIT Press.
31. L. Sterling and R. D. Beer. Meta interpreters for expert system construction. Journal of Logic Programming, 6(1&2):163-178, 1989.
32. L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986.
33. A. Takeuchi and K. Furukawa. Partial evaluation of Prolog programs and its application to metaprogramming. In H.-J. Kugler, editor, Information Processing 86, pages 415-420, 1986.