Abstract (EN):
We present a Counting Algorithm that computes the number of X-terms in P-normal form that have a given type tau as a principal type and produces a list of these terms. The design of the algorithm follows the lines of Ben-Yelles' algorithm for counting normal (not necessarily principal) inhabitants of a type tau. Furthermore, we show that one can use similar algorithms with adequate limits to count normal and principal normal inhabitants in the lambdaI-calculus.
Idioma:
Inglês
Tipo (Avaliação Docente):
Científica
Nº de páginas:
19