Skip to main content
SpringerLink
Log in

Head boundedness of nonterminating rewritings

  • Brief Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Further research about nonterminating rewritings is introduced. First, the previous definition of head boundedness is modified to exclude non-fair reduction sequences. A sufficient condition is then given to determine head boundedness of term rewriting systems. The condition is then developed to a method to determine head boundedness of constructor systems.

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

References

  1. Nachum Dershowitz, Stéphane Kaplan, Rewrite, rewrite, rewrite, rewrite, rewrite …. In16th Annual Symposium on Principles of Programming Languages, SIGPLAN and SIGACT, pp. 250–259, 1989.

  2. Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted. Infinite normal forms. Lecture Notes in Computer Science, Springer-Verlag, Vol. 372, pp. 249–262, 1989.

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Turner D A. Miranda: A non-strict functional language with polymorphic types. Lecture Notes in Computer Science, Springer-Verlag, Vol. 201, 1985.

  5. Hudak Pet al. Report on the Functional Programming Language Haskell. Draft Proposed Standard, 1988.

  6. O'Donnell M J. Equational logic as a programming language. MIT Press, Cambridge, MA, 1985.

    MATH  Google Scholar 

  7. Chen Yiyun. Nonterminating rewritings with head boundedness.Journal of Computer Science and Technology, 1993, 8(2), 162–171.

    Article  MathSciNet  Google Scholar 

  8. Nachum Dershowitz. Termination of rewriting.J. of Symbolic Computation, 3.1 & 2, pp. 69–115, 1987; Corrigendum in 4.3, pp. 409–410, 1987.

    Article  MathSciNet  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 research is supported by the National Natural Science Foundation of China.

Chen Yiyun received his M.S. degree in computer software from East-China Institute of Computer Technology in 1982. Now he is an Associate Professor of computer science at University of Science and Technology of China. His research interests include formal approaches to the specification and rigorous development of softwares, rewriting techniques and applications, and formal semantics.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, Y. Head boundedness of nonterminating rewritings. J. of Compt. Sci. & Technol. 10, 281–284 (1995). https://doi.org/10.1007/BF02943496

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation