Skip to main content

Generalized partial computation using disunification to solve constraints

  • Contextual Rewriting and Constrained Rewriting
  • Conference paper
  • First Online:
Conditional Term Rewriting Systems (CTRS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 656))

Included in the following conference series:

Abstract

Generalized Partial Computation (GPC) is a program optimization principle based on partial computation and theorem proving. Techniques in conventional partial computation make use of only static values of given data to specialize programs. GPC employs a theorem prover to explicitly utilize more information such as logical structure of programs, axioms for abstract data types, algebraic properties of primitive functions, etc. In this paper we formalize a GPC transformation method for a first-order language which utilizes a disunification procedure to reason about the program context. Context information of each program fragment is represented by a quantifier-free equational formula and is used to eliminate redundant transformation.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Comon. Disunification: a survey. In J.-L. Lassez and G. Plotkin, eds., Computational Logic: Essays in Honor of Alan Robinson. MIT Press, 1991.

    Google Scholar 

  2. H. Comon, M. Haberstrau and J.-P. Jouannaud. Decidable Problems in Shallow Equational Theories. In Proc. 7th IEEE Symp. Logic in Computer Science, June 1992.

    Google Scholar 

  3. Y. Futamura and K. Nogi. Generalized Partial Computation. In D. BJørner, A. P. Ershov and N. D. Jones, eds., Partial Evaluation and Mixed Computation, 133–151, North-Holland, 1988.

    Google Scholar 

  4. Y. Futamura and K. Nogi. Program Evaluation and Generalized Partial Computation. In Proceedings of the International Conf. on Fifth Generation Computer Systems, 685–692, Tokyo, 1988.

    Google Scholar 

  5. Y. Futamura, K. Nogi and A. Takano. Essence of Generalized Partial Computation. Theoretical Computer Science, 90: 61–79, 1991.

    Google Scholar 

  6. N.D. Jones, P. Sestoft and H. Søndergaard. MIX: An Self-applicable Partial Evaluator for Experiments in Compiler Generation. LISP and Symbolic Computation, 2 (1): 9–50, 1989.

    Article  Google Scholar 

  7. J. Launchbury. Projection Factorizations in Partial Evaluation. Cambridge University Press, 1991.

    Google Scholar 

  8. G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. J. ACM, 27: 356–364, 1980.

    Google Scholar 

  9. A. Takano. Generalized Partial Computation for a Lazy Functional Language. In Proc. ACM Symp. on Partial Evaluation and Semantics-Based Program Manipulation. ACM SIGPLAN Notices, 26 (9): 1–11, June 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Michaël Rusinowitch Jean-Luc Rémy

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Takano, A. (1993). Generalized partial computation using disunification to solve constraints. In: Rusinowitch, M., Rémy, JL. (eds) Conditional Term Rewriting Systems. CTRS 1992. Lecture Notes in Computer Science, vol 656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56393-8_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-56393-8_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56393-8

  • Online ISBN: 978-3-540-47549-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics