Affiliation:
1. University of Lyon, Lyon, France
Abstract
Affine λ-terms are λ-terms in which each bound variable occurs at most once, and linear λ-terms are λ-terms in which each bound variable occurs once and only once. In this article, we count the number of affine closed λ-terms of size
n
, linear closed λ-terms of size
n
, affine closed β-normal forms of size
n
, and linear closed β-normal forms of size
n
, for several measures of the size of λ-terms. From these formulas, we show how we can derive programs for generating all the terms of size
n
for each class. The foundation of all of this is a specific data structure, made of contexts in which one counts all the holes at each level of abstractions by λ’s.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference28 articles.
1. Henk P. Barendregt. 1984. The Lambda-Calculus Its Syntax and Semantics (2nd ed.). Elsevier Science Publishers B. V. (North-Holland) Amsterdam. Henk P. Barendregt. 1984. The Lambda-Calculus Its Syntax and Semantics (2nd ed.). Elsevier Science Publishers B. V. (North-Holland) Amsterdam.
2. Maciej Bendkowski Katarzyna Grygiel Pierre Lescanne and Marek Zaionc. 2016. Combinatorics of λ-terms: A natural approach. CoRR abs/1609.07593 (2016). http://arxiv.org/abs/1609.07593 Maciej Bendkowski Katarzyna Grygiel Pierre Lescanne and Marek Zaionc. 2016. Combinatorics of λ-terms: A natural approach. CoRR abs/1609.07593 (2016). http://arxiv.org/abs/1609.07593
3. A Natural Counting of Lambda Terms
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Deriving Theorems in Implicational Linear Logic, Declaratively;Electronic Proceedings in Theoretical Computer Science;2020-09-19