A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Generalized finite developments
[chapter]

*
From Semantics to Computer Science
*

The Finite Development theorem (FD) is a fundamental theorem in the theory of the syntax of the lambda-calculus. It gives sense to parallel reductions by stating that one can contract any given set of (possibly nested) redexes in any lambda term without looping and caring about the order in which these redexes are contracted. This theorem can be used to prove the Church-Rosser property, thus insuring determinism of reductions and uniqueness of normal forms. This paper explains how to extend the

doi:10.1017/cbo9780511770524.010
fatcat:lwlhc6ecobffrc5qabjiimqkky