Skip to main content
SpringerLink
Log in

Infinite normal forms for non-linear term rewriting systems

  • Contributions
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1991 (MFCS 1991)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Courcelle, B., Kahn, G., Vuillemin, J. Algorithmes d'Equivalence et de Reduction a des Expressions Minimales dans une Classe d'Equations Recursives Simples, Proc. Automata, Languages and Programming, 2nd Colloquium, Saarbrucken, LNCS 14, (1974), 200–213.

    Google Scholar 

  2. De Nicola, R., Inverardi, P., Nesi, M. Using the Axiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications, in Proc. Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407 (1990), 54–67.

    Google Scholar 

  3. Dershowitz, N., Kaplan, S. Rewrite, Rewrite, Rewrite, Rewrite, Rewrite..., Proc. 16th Annual ACM Symposium on POPL, Austin, Texas, (1989), 250–259.

    Google Scholar 

  4. Dershowitz, N., Kaplan, S., Plaisted, D.A. Infinite Normal Forms, Proc. 16th ICALP, Stresa, Italy, LNCS 372, (1989), 249–262.

    Google Scholar 

  5. Dershowitz, N., Kaplan, S., Plaisted, D.A. Rewrite, Rewrite, Rewrite, Rewrite, Rewrite..., Theoretical Computer Science, in press.

    Google Scholar 

  6. Givler, J.S. Continuous Rewriting Systems, IBM T.J. Watson Res. Center Report, (1990).

    Google Scholar 

  7. van Glabbeek, R.J., Weijland, W.P. Branching Time and Abstraction in Bisimulation Semantics, Proc. IFIP 11th World Computer Congress, San Francisco, (1989).

    Google Scholar 

  8. Inverardi, P., Nesi, M. A Rewriting Strategy to Verify Observational Congruence, Information Processing Letters Vol. 35, No. 4, (August 1990), 191–199.

    Google Scholar 

  9. Inverardi, P., Nesi, M. Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting, I.E.I. Internal Report no B4–10, (March 1990).

    Google Scholar 

  10. Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J. An Infinitary Church-Rosser Property for Non-collapsing Orthogonal Term Rewriting Systems, CWI Report CS-R9043, (1990).

    Google Scholar 

  11. Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J. Transfinite Reductions in Orthogonal Term Rewriting Systems, CWI Report CS-R9042, Amsterdam, (1990), Proceedings of the RTA'91 Conference, LNCS 488, (1991), 1–12.

    Google Scholar 

  12. Milner, R. A Calculus of Communicating Systems, LNCS 92, (1980).

    Google Scholar 

  13. Milner, R. A Complete Axiomatization for Observational Congruence of Finite-State Behaviours, Information and Computation 81, (1989), 227–247.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IEI - CNR, via S. Maria 46, I-56126, Pisa, Italy

    P. Inverardi & M. Nesi

  2. Computer Laboratory, University of Cambridge, Cambridge, UK

    M. Nesi

Authors
  1. P. Inverardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Nesi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Inverardi, P., Nesi, M. (1991). Infinite normal forms for non-linear term rewriting systems. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_66

Download citation

  • DOI: https://doi.org/10.1007/3-540-54345-7_66

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54345-9

  • Online ISBN: 978-3-540-47579-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation