Skip to main content
SpringerLink
Log in

Church-Rosser theorems for replacement systems

  • Conference paper
  • First Online:
Algebra and Logic

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 450))

Abstract

Replacement systems with the Church-Rosser property promise to be of great interest for the theory of parallel programming languages; particular systems have long been of interest in theories of combinatory logic and lambda conversion. This paper reviews known methods for proving the Church-Rosser property for general replacement systems and adds some new results. Finally some open problems are listed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. BARENDREGT, H.P. Some extensional term models for combinatory logics and λ-calculi. Ph.D. thesis, U. Utrecht, 1971.

    Google Scholar 

  2. CURRY, H.B. and R. FEYS Combinatory logic, North-Holland, Amsterdam, 1958.

    MATH  Google Scholar 

  3. HINDLEY, R. The Church-Rosser property and a result in combinatory logic. Ph.D. thesis, U. Newcastle-upon-Tyne, 1964.

    Google Scholar 

  4. An abstract form of the Church-Rosser theorem, I. J. Symbolic Logic 34, 1969, 545–560.

    Article  MathSciNet  MATH  Google Scholar 

  5. An abstract Church-Rosser theorem, II: applications. J. Symbolic Logic, 39, 1974, 1–21.

    Article  MathSciNet  MATH  Google Scholar 

  6. MITSCHKE, G. Ein algebraischer Beweis für das Church-Rosser Theorem, Arch. math. Logik 15, 1973, 146–157.

    Article  MathSciNet  MATH  Google Scholar 

  7. ROSEN, B.K. Tree-manipulating systems and Church-Rosser theorems. J.A.C.M. 20, 1973, 160–187.

    MathSciNet  MATH  Google Scholar 

  8. SCHROER, D.E. The Church-Rosser theorem. Ph.D. thesis, Cornell University, 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Australian National University, Canberra, Australia

    John Staples

Authors
  1. John Staples
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Newsome Crossley

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag

About this paper

Cite this paper

Staples, J. (1975). Church-Rosser theorems for replacement systems. In: Crossley, J.N. (eds) Algebra and Logic. Lecture Notes in Mathematics, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062861

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07152-5

  • Online ISBN: 978-3-540-37480-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation