On the enumeration of closures and environments with an application to random generation
From MaRDI portal
Publication:4972734
zbMath1442.68023arXiv1802.00640MaRDI QIDQ4972734
Maciej Bendkowski, Pierre Lescanne
Publication date: 26 November 2019
Full work available at URL: https://arxiv.org/abs/1802.00640
Exact enumeration problems, generating functions (05A15) Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Complexity analysis of term-rewriting systems
- A calculus for the random generation of labelled combinatorial structures
- Enumerating lambda terms by weighted length of their de Bruijn representation
- A Natural Counting of Lambda Terms
- (Leftmost-Outermost) Beta Reduction is Invariant, Indeed
- Analysing the complexity of functional programs: higher-order meets first-order
- λν, a calculus of explicit substitutions which preserves strong normalisation
- On the likelihood of normalization in combinatory logic
- Singularity Analysis of Generating Functions
- Smoothed analysis of algorithms
- On Constructor Rewrite Systems and the Lambda-Calculus
- Behavioural Categoricity of Abstract Data Type Specifications
- GFUN
- Confluence properties of weak and strong calculi of explicit substitutions
- Concepts in Programming Languages
- Combinatorics of $\lambda$-terms: a natural approach
- On the number of lambda terms with prescribed size of their De Bruijn representation
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Asymptotically almost all \lambda-terms are strongly normalizing
- On the enumeration of closures and environments with an application to random generation
- Lambda terms of bounded unary height
- Polynomial tuning of multiparametric combinatorial samplers
- A Singular Mathematical Promenade
- Counting and generating terms in the binary lambda calculus
- Normal-order reduction grammars
- Closing the Gap Between Runtime Complexity and Polytime Computability.
- The Mechanical Evaluation of Expressions
This page was built for publication: On the enumeration of closures and environments with an application to random generation