The Church-rosser theorem in orthogonal combinatory reduction systems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 1992

The Church-rosser theorem in orthogonal combinatory reduction systems

Résumé

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.

Domaines

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

Dates et versions

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

Identifiants

  • HAL Id : inria-00074847 , version 1

Citer

Zurab Khasidashvili. The Church-rosser theorem in orthogonal combinatory reduction systems. [Research Report] RR-1825, INRIA. 1992. ⟨inria-00074847⟩
102 Consultations
44 Téléchargements

Partager

Gmail Facebook X LinkedIn More