Skip to main content
Springer Nature Link
Log in

Competitive partial evaluation

Some remaining problems of partial evaluation

  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

This paper discusses the remaininig problems of partial evaluation, comparing competitive partial evaluation to expert programmers who are able to improve programs very effectively. Two case studies of medium size examples are presented to show how to obtain maximal speedup and global control of partial evaluation respectively. These studies are expected to suggest the direction of future research towards everyday-use partial evaluation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Takeuchi, A. and Furukawa, K., “Partial Evaluation of Prolog Programs ans Its Application to Meta Programming” inInformation Processing 86 (H.-J. Kugler ed.), North-Holland, Amsterdam, pp. 415–420, 1986.

    Google Scholar 

  2. Safra, S. and Shapiro, E., “Meta Interpreters for Real,” inInformation Processing 86 (H.-J. Kugler ed.), North-Holland, Amsterdam, pp. 415–420, 1986.

    Google Scholar 

  3. Fujita, H., “On Automating Partial Evaluation of Prolog Programs,”ICOT Technical Memorandum, TM-250, 1987 [in Jananese].

  4. Futamura, Y., “Logic Dependent Partial Computation,”The Third Meeting on Program Transformation and Synthesis, Japan Society for Software Science and Technology, 1987 [in Japanese].

  5. Fujita, H., “An Algorithm for Partial Evaluation with Constraints,”ICOT Technical Memorandum, TM-367, 1987 [in Japanese].

  6. Tamaki, H. and Sato, T., “Unfold/Fold Transformation of Logic Programs,”Proc. of The Second International Logic Programming Conference, Uppsala, pp. 127–138, 1984.

  7. Jones, N. D., “Challenging Problems,”private communication, 1987.

  8. Forgy, C., “RETE: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem,”Artificial Intelligence, 19, pp. 17–37, 1982.

    Article  Google Scholar 

  9. Fujita, H. and Furukawa, K., “A Self-Applicable Partial Evaluator and Its Use in Incremental Compilation,”ICOT Technical Report, TR-250, 1987.

  10. Matsumoto, Y., Tanaka, H., Hirakawa, H., Miyoshi, H. and Yasukawa, H., “BUP: A Bottom-UP Parser Embedded in Prolog,”New Generation Computing, 1, 145–158, 1983.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Central Research Laboratory, Mitsubishi Electric Corp., 8-1-1, Tsukaguchi Honmachi, 661, Amagasaki, Hyogo, Japan

    Akikazu Takeuchi

  2. ICOT Research Center, Institute for New Generation Computer Technology, 1-4-28, Mita, Minato-ku, 108, Tokyo, Japan

    Hiroshi Fujita

Authors
  1. Akikazu Takeuchi
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Hiroshi Fujita
    View author publications

    You can also search for this author inPubMed Google Scholar

About this article

Cite this article

Takeuchi, A., Fujita, H. Competitive partial evaluation. New Gener Comput 6, 259–277 (1988). https://doi.org/10.1007/BF03037141

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037141

Keywords