ISBN:  Unavailable

Category: Unavailable

Page count: 31

Abstract: "A typechecker for a typed [lambda]-calculus having implicit arguments is presented. The typechecker works in such a way that the uniqueness of implicit arguments is always preserved during reduction. Consequently, when it compares two terms by reduction, it can reduce them without inferring implicit arguments. Before describing the typechecker, we analyze various situations where the uniqueness of implicit arguments is not preserved by naïvely defined reduction."