DeepAI AI Chat
Log In Sign Up

Counting Environments and Closures

by   Maciej Bendkowski, et al.

Environments and closures are two of the main ingredients of evaluation in lambda-calculus. A closure is a pair consisting of a lambda-term and an environment, whereas an environment is a list of lambda-terms assigned to free variables. In this paper we investigate some dynamic aspects of evaluation in lambda-calculus considering the quantitative, combinatorial properties of environments and closures. Focusing on two classes of environments and closures, namely the so-called plain and closed ones, we consider the problem of their asymptotic counting and effective random generation. We provide an asymptotic approximation of the number of both plain environments and closures of size n. Using the associated generating functions, we construct effective samplers for both classes of combinatorial structures. Finally, we discuss the related problem of asymptotic counting and random generation of closed environemnts and closures.


page 1

page 2

page 3

page 4


Combinatorics of explicit substitutions

λυ is an extension of the λ-calculus which internalises the calculus of ...

Statistical properties of lambda terms

We present a quantitative, statistical analysis of random lambda terms i...

On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms

Uniquely closable skeletons of lambda terms are Motzkin-trees that prede...

Descriptive Complexity for Counting Complexity Classes

Descriptive Complexity has been very successful in characterizing comple...

Asymptotic Distribution of Parameters in Trivalent Maps and Linear Lambda Terms

Structural properties of large random maps and lambda-terms may be glean...

Towards the average-case analysis of substitution resolution in λ-calculus

Substitution resolution supports the computational character of β-reduct...

Lambda Congruences and Extensionality

In this work we provide alternative formulations of the concepts of lamb...