Papers › Quantitative aspects of linear and affine closed lambda terms
Quantitative aspects of linear and affine closed lambda terms
Pierre Lescanne
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Affine λ-terms are λ-terms in which each bound variable occurs at most once and linear λ-terms are λ-terms in which each bound variables occurs once. and only once. In this paper we count the number of closed affine λ-terms of size n, closed linear λ-terms of size n, affine β-normal forms of size n and linear β-normal forms of ise n, for different ways of measuring 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. For this we use a specific data structure, which are contexts taking into account all the holes at levels of abstractions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections