Qualified answers and their application to transformation

  • Phil Vasey
Session 4b: Theory And Higher-Order Functions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 225)


Logic Program Partial Evaluation Query Optimisation Prolog Program Qualified Answer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Burstall, R. and Darlington, J. “Transformation for developing recursive programs” J. ACM, Volume 24, No. 1, pp 44–67, 1975Google Scholar
  2. [2]
    Clark, K. “Negation as failure” Logic and Data Bases (Eds. Gallaire, H. and Minker, J.), Plenum Press, pp 293–322, 1978Google Scholar
  3. [3]
    Clark, K. and Darlington, J. “Algorithm classification through synthesis” Computer Journal, pp 61–65, 1980Google Scholar
  4. [4]
    Kowalski, R. “Logic for problem solving” North Holland Press, pp 227–228, 1979.Google Scholar
  5. [5]
    Sergot, M. “A query-the-user facility for logic programming” Integrated Interactive Computer Systems (Eds. Degano, P. and Sandwell, E.), North Holland Press, pp 27–41, 1983.Google Scholar
  6. [6]
    Takeuchi, A. and Furukawa, K. “Partial evaluation of PROLOG programs and its application to meta programming” Res. Rep., ICOT Research Centre, Tokyo, Japan, 1985.Google Scholar
  7. [7]
    Tamaki, H. and Sato, T. “Unfold/fold transformation of logic programs” Proceedings of ICLP, pp 127–138, 1984.Google Scholar
  8. [8]
    Venken, R. “A PROLOG meta-interpreter for partial evaluation and its application to source-to-source transformation and query optimisation” Proceedings of ECAI, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Phil Vasey
    • 1
  1. 1.Dept. of ComputingImperial CollegeLondon

Personalised recommendations