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`

.

##
###
Federal Republic of Germany

1977
*
Representation
*

It is well known that the full reduction tree for any term of the typed 2-calculus is finite. However, it is not obvious how a reasonable estimate for its height might be obtained. Here we note that the head reduction tree has the property that the number of its nodes with conversions bounds the length of any reduction sequence*. The height of that tree, and hence also the number of its nodes, can be estimated using a technique due to Howard [31 which in turn is based on work of Sanchis [4] and

doi:10.1080/03115517708619392
fatcat:agmu5m6hgfhslcy5oof226pb3a