Counting a Type's (Principal) Inhabitants

Authors:
Sabine Broda;Luís Damas
Affiliations:
-;-
Venue:
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Year:
2001

Citing 6
Cited 1

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
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Basic simple type theory

Basic simple type theory
Normal Proofs and Their Grammar

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software

A Context-Free Grammar Representation for Normal Inhabitants of Types in TAlambda

EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.