The set of unifiers in typed &lgr;-calculus as regular expression
Proc. of the first international conference on Rewriting techniques and applications
Mechanical procedure for proof construction via closed terms in typed &lgr; calculus
Journal of Automated Reasoning
Principal types of BCK-lambda-terms
Theoretical Computer Science
Handbook of logic in computer science (vol. 2)
Basic simple type theory
Normal Proofs and Their Grammar
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Hi-index | 0.00 |
We present a Counting Algorithm that computes the number of λ-terms in β-normal form that have a given type τ 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 τ. Furthermore, we show that one can use similar algorithms with adequate limits to count normal and principal normal inhabitants in the λI-calculus.