Church-Rosser property
التعريفات والمعاني
== English ==
=== Etymology ===
Alonzo Church and J. Barkley Rosser proved in 1936 that lambda calculus has this property.
=== Noun ===
Church-Rosser property (plural Church-Rosser properties)
(logic, computer science) The property of a rewriting system for which
x
↔
∗
y
{\displaystyle x{\stackrel {*}{\leftrightarrow }}y}
implies
x
↓
y
{\displaystyle x{\mathbin {\downarrow }}y}
for all objects
x
{\displaystyle x}
,
y
{\displaystyle y}
.