Counting isomorphism classes of $\beta$-normal linear lambda terms
Logic in Computer Science
2015-09-28 v1 Combinatorics
Logic
Abstract
Unanticipated connections between different fragments of lambda calculus and different families of embedded graphs (a.k.a. "maps") motivate the problem of enumerating -normal linear lambda terms. In this brief note, it is shown (by appeal to a theorem of Arqu\`es and Beraud) that the sequence counting isomorphism classes of -normal linear lambda terms up to free exchange of adjacent lambda abstractions coincides with the sequence counting isomorphism classes of rooted maps on oriented surfaces (A000698).
Cite
@article{arxiv.1509.07596,
title = {Counting isomorphism classes of $\beta$-normal linear lambda terms},
author = {Noam Zeilberger},
journal= {arXiv preprint arXiv:1509.07596},
year = {2015}
}
Comments
5 pages