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 τ.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. Barendregt. Lambda calculi with types. In Abramsky, Gabbay, and Maibaum, editors, Background: Computational Structures, volume 2 of Handbook of Logic in Computer Science, pages 117–309. Oxford Science Publications, 1992.
C.-B. Ben-Yelles. Type-assignment in the lambda-calculus; syntax and semantics. PhD thesis, Mathematics Dept., University of Wales Swansea, UK, 1979.
J. R. Hindley. Basic Simple Type Theory. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1997.
S. Hirokawa. Principal types of BCK-lambda-terms. Theoretical Computer Science, 107:253–276, 1993.
M. Takahashi, Y. Akama, and S. Hirokawa. Normal proofs and their grammar. In M. Hagiya and J. Mitchell, editors, Theoretical Aspects of Computer Software (TACS’94), volume 789 of LNCS, pages 465–493. Springer Verlag, 1994.
M. Zaionc. The set of unifiers in typed λ-calculus as regular expression. In J.-P. Jouannaud, editor, Rewriting Techniques and Applications, volume 202 of LNCS, pages 430–440. Springer Verlag, 1985.
M. Zaionc. Mechanical procedure for proof construction via closed terms in typed λ-calculus. J. Automated Reasoning, 4:173–190, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broda, S., Damas, L. (1999). Counting a Type’s Principal Inhabitants. In: Girard, JY. (eds) Typed Lambda Calculi and Applications. TLCA 1999. Lecture Notes in Computer Science, vol 1581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48959-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-48959-2_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65763-7
Online ISBN: 978-3-540-48959-7
eBook Packages: Springer Book Archive