Skip to main content
Springer Nature Link
Log in

Unfolding rules for GHC programs

  • Published:
New Generation Computing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

This paper presents a set of rules for the transformation of GHC (Guarded Horn Clauses) programs based on unfolding. The proposed set of rules, called UR-set, is shown to preserve freedom from deadlock and to preserve the set of solutions to be derived. UR-set is expected to give a basis for various program transformations, especially partial evaluation of GHC programs.

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. Brock, J. D. and Ackerman, W. B., “Scenario: A Model of Nondeterminate Computation,” inFormalization of Programming Concepts (J. Diaz and I. Ramos, ed.),Lecture Notes in Computer Science, Vol. 107, Springer-Verlag, 1981.

  2. Clark, K. L. and Gregory, S., “PARLOG: Parallel Programming in Logic,”ACM Trans. Program. Lang. Syst. 8,1.

  3. Furukawa, K. and Ueda, K., “GHC Process Fusion by Program Transformation,”Proc. the Second Annual Conference of Japan Society of Softwate Science and Technology, 1985.

  4. Shapiro, E. Y., “A Subset of Concurrent Prolog and Its Interpreter,”ICOT Tech. Report, TR-003.

  5. Shapiro, E. Y., “Concurrent Prolog: A Progress Report,”IEEE Computer, Vol.19,No. 8, 1986.

  6. Ueda, K., “Guarded Horn Clauses,”Proc. Logic Programming ’85 (Lecture Notes in Computer Science, Vol. 221), Springer-Verlag, 1986.

  7. Ueda, K., et al., “Transformation Rules for FGHC Programs,” forthcoming, 1988.

Download references

Author information

Authors and Affiliations

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

    Koichi Furukawa, Akira Okumura & Masaki Murakami

Authors
  1. Koichi Furukawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akira Okumura
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masaki Murakami
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Furukawa, K., Okumura, A. & Murakami, M. Unfolding rules for GHC programs. New Gener Comput 6, 143–157 (1988). https://doi.org/10.1007/BF03037135

Download citation

  • Received:

  • Issue Date:

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

Keywords