Skip to main content
SpringerLink
Log in

Nonterminating rewritings with head boundedness

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

We define here the concept of head boundedness, head normal form and head confluence of term rewriting systems that allow infinite derivations. Head confluence is weaker than confluence, but sufficient to guarantee the correctness of lazy implementations of equational logic programming languages. Then we prove several results. First, if a left-linear system is locally confluent and head-bounded, then it is head-confluent. Second, head-confluent and head-bounded systems have the head Church-Rosser property. Last, if an orthogonal system is head-terminating, then it is head-bounded. These results can be applied to generalize equational logic programming languages.

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

Access this article

Log in via an institution

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

References

  1. G. Huet, Confluent reductions: Abstract properties and applications to term rewirting systems.JACM, 1980, 27(4), 797–821.

    Article  MATH  MathSciNet  Google Scholar 

  2. Nachum Dershowitz, Termination of rewriting.J. Symbolic Computation, 1987, 3(1–2), 69–115; 1987, 4(3), 409–410.

    Article  MATH  MathSciNet  Google Scholar 

  3. Nachum Dershowitz and Stéphane Kaplan. Rewrite, rewrite, rewrite, rewrite, rewrite…, Proc. 16-th ACM Symp. on Principles of Programming Languages, Austin, TX, 1989, 250–259.

  4. D. A. Turner, Miranda: A non-strict functional language with polymorphic types. LNCS 201, Springer-Verlag, 1985.

  5. P. Hudaket al., Report on the Functional Programming Language Haskell. Draft Proposed Standard, 1988.

  6. M. J. O'Donnell, Equational Logic as a Programming Language, MIT Press, Cambridge, MA, 1985.

    MATH  Google Scholar 

  7. Nachum Dershowitz, Stéphane Kaplan and David A. Plaisted, Infinite normal forms. LNCS 372, Springer-Verlag, 1989, 249–262.

  8. Nachum Dershowitz, Stéphane Kaplan and David A. Plaisted, Rewrite, rewrite, rewrite, rewrite, rewrite…,Theoretical Computer Science, 1991, 83(1), 71–96.

    Article  MATH  MathSciNet  Google Scholar 

  9. Haskell B. Curry, Robert Feys and William Craig, Combinatory Logic, Volume I. North-Holland Publishing Company, Amsterdam, 1958.

    Google Scholar 

  10. Yiyun Chen and Michael J. O'Donnell, Testing confluence of nonterminating rewriting systems. Technical Report 90-07, The University of Chicago; also in LNCS 516, 127–136.

  11. J. R. Kennaway, J. W. Klop, M. R. Sleep and F. J. De Vries, Transfinite Reductions in Orthogonal Term Rewriting Systems. Report CS-R904, CWI, Amsterdam, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Science and Technology of China, 230026, Hefei

    Chen Yiyun

Authors
  1. Chen Yiyun
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The project is supported by the National Natural Science Foundation of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yiyun, C. Nonterminating rewritings with head boundedness. J. of Compt. Sci. & Technol. 8, 162–171 (1993). https://doi.org/10.1007/BF02939479

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation