6
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels

      Preprint
      ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We investigate the number of variables in two special subclasses of lambda-terms that are restricted by a bound of the number of abstractions between a variable and its binding lambda, the so-called De-Bruijn index, or by a bound of the nesting levels of abstractions, \textit{i.e.}, the number of De Bruijn levels, respectively. These restrictions are on the one hand very natural from a practical point of view, and on the other hand they simplify the counting problem compared to that of unrestricted lambda-terms in such a way that the common methods of analytic combinatorics are applicable. We will show that the total number of variables is asymptotically normally distributed for both subclasses of lambda-terms with mean and variance asymptotically equal to \(Cn\) and \(\tilde{C}n\), respectively, where the constants \(C\) and \(\tilde{C}\) depend on the bound that has been imposed. So far we just derived closed formulas for the constants in case of the class of lambda-terms with bounded De Bruijn index. However, for the other class of lambda-terms that we consider, namely lambda-terms with a bounded number of De Bruijn levels, we investigate the number of variables, as well as abstractions and applications, in the different De Bruijn levels and thereby exhibit a so-called "unary profile" that attains a very interesting shape.

          Related collections

          Most cited references18

          • Record: found
          • Abstract: not found
          • Article: not found

          Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Boltzmann Samplers for the Random Generation of Combinatorial Structures

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              On Convergence Rates in the Central Limit Theorems for Combinatorial Structures

                Bookmark

                Author and article information

                Journal
                12 March 2019
                Article
                1903.05243
                ad7a49eb-97a1-4983-bd41-00bb3ba52096

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                05A16 (Primary) 60C05, 30B40, 05C20 (Secondary)
                30 pages, 8 figures
                math.CO

                Combinatorics
                Combinatorics

                Comments

                Comment on this article