Abstract

. We define a class of hyperbalanced l-terms by imposing syntactic constraints on the construction of l-terms, and show that such terms are strongly normalizing. Furthermore, we show that for any hyperbalanced term, the total number of superdevelopments needed to compute its normal form can be statically determined at the beginning of reduction. To obtain the latter result, we develop an algorithm that, in a hyperbalanced term M, statically detects all inessential (or unneeded)subterms which can be replaced by fresh variables without effecting the normal form of M; that is, full garbage collection can be performed before starting the reduction. Finally, we show that, modulo a restricted h-expansion, all simply typable l-terms are hyperbalanced, implying importance of the class of hyperbalanced terms. 1 Introduction The termination of b-reduction for typed terms is one of the most studied topics in l- calculus. After classical proofs of Tait [21] and Girard [8], many interesting proo...

Citations