Typed calculus with denumerable set of ground types is considered. The aim of the paper is to show procedure for counting closed terms in long normal forms. It is shown that there is a surprising correspondence between the number of closed terms and the xpoint solution of the polynomial equation in some complete lattice. It is proved that counting of terms… (More)

Sorry, we couldn't extract any figures or tables for this paper.