On Some Enumerative Problems in Lambda Calculus.

Combinatorial problems related to the enumeration of lambda terms in the untyped lambda calculus and in the Church-style simply typed lambda calculus with a single atom are considered. For the case of untyped lambda calculus, a system of equations for generating functions that enumerate lambda terms is derived. For the typed lambda calculus, the inhabited types are enumerated, as well as their primitive inhabitants. Bibliography: 11 titles. [ABSTRACT FROM AUTHOR]