Counting environments and closures

DOI10.4230/LIPICS.FSCD.2018.11MaRDI QIDQ4993337zbMATH OpenFDO

Authors Maciej Bendkowski, Pierre Lescanne

Publication date 15 June 2021

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2018.11

zbMATH Keywords

combinatoricscomplexityfunctional programminglambda-calculusmathematical analysis

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Combinatorics in computer science (68R05)

Recommendations

• On the enumeration of closures and environments with an application to random generation
• Counting and generating lambda terms
• Explicit environments
• Quantitative Aspects of Linear and Affine Closed Lambda Terms
• scientific article; zbMATH DE number 1342289

Cites work

• (Leftmost-outermost) beta reduction is invariant, indeed
• A calculus for the random generation of labelled combinatorial structures
• Analysing the complexity of functional programs: higher-order meets first-order
• Analytic combinatorics
• Asymptotically almost all \lambda-terms are strongly normalizing
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Closing the gap between runtime complexity and polytime computability
• Combinatorics of \(\lambda\)-terms: a natural approach
• Concepts in Programming Languages
• Confluence properties of weak and strong calculi of explicit substitutions
• Counting and generating terms in the binary lambda calculus
• Generatingfunctionology
• GFUN
• scientific article; zbMATH DE number 4074465 (Why is no real title available?)
• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• scientific article; zbMATH DE number 1513875 (Why is no real title available?)
• scientific article; zbMATH DE number 3400430 (Why is no real title available?)
• Lambda terms of bounded unary height
• Normal-order reduction grammars
• On constructor rewrite systems and the lambda calculus
• On the likelihood of normalization in combinatory logic
• On the number of lambda terms with prescribed size of their de Bruijn representation
• Polynomial tuning of multiparametric combinatorial samplers
• Singularity Analysis of Generating Functions
• Smoothed analysis of algorithms
• The Mechanical Evaluation of Expressions

Cited in

(1)

• On the enumeration of closures and environments with an application to random generation

Describes a project that uses

Uses Software

• Haskell
• QuickCheck
• gfun
• GitHub

This page was built for publication: Counting environments and closures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993337)