The Church-rosser theorem in orthogonal combinatory reduction systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

The Church-rosser theorem in orthogonal combinatory reduction systems

Abstract

We introduce a notion of Combinatory Reduction Systems (CRSs) by extending the notion of Term Rewriting Systems (TRSs) with variable-binding and substitution mechanisms, define orthogonal CRSs (OCRSs) and prove a strict version of the Church-Rosser theorem for all OCRSs. Our notion of OCRSs is almost equivalent to that of Klop, Kennaway and Van Raamsdonk. Different proofs of the Church-Rosser theorem are in Klop and in Van Raamsdonk.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1825.pdf (937.8 Ko) Télécharger le fichier

Dates and versions

inria-00074847 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074847 , version 1

Cite

Zurab Khasidashvili. The Church-rosser theorem in orthogonal combinatory reduction systems. [Research Report] RR-1825, INRIA. 1992. ⟨inria-00074847⟩
101 View
41 Download

Share

Gmail Facebook Twitter LinkedIn More