# Church-Rosser theorem

Jump to navigation
Jump to search

## English[edit]

### Etymology[edit]

Introduced by Alonzo Church and J. Barkley-Rosser in a 1936 paper.

### Proper noun[edit]

- (mathematics, computing theory) A theorem stating that, when applying reduction rules to terms in the lambda calculus, the ordering in which the reductions are chosen makes no difference to the eventual result.