Abstract

In this paper the main canonical notion of δ-reduction is considered. Typed λ-terms use variables of any order and constants of order ≤1, where constantsof order 1 are strongly computable, monotonic functions with indeterminatevalues of arguments. The canonical notion of δ-reduction is the notion of δ-reduction that is used in the implementation of functional programminglanguages. For main canonical notion of δ-reduction the uniqueness of β δ-normal form of typed λ-terms is shown.

‹ 1 / ? › − 100% + Open in new tab Download Cite

Loading the full text…