On uniquely closable and uniquely typable skeletons of lambda terms

DOI10.1007/978-3-319-94460-9_15MaRDI QIDQ1671157zbMATH OpenOpenAlexFDO

Authors Olivier Bodini, Paul Tarau

Publication date 6 September 2018

Full work available at URL https://arxiv.org/abs/1709.04302

zbMATH Keywords

combinatorics of lambda termscomputational mathematicsefficient logic programsinferring simple typeslogic programminguniquely closable lambda term skeletonsuniquely typable lambda term skeletons

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic programming (68N17) Grammars and rewriting systems (68Q42)

Recommendations

• Counting and generating lambda terms
• A hiking trip through the orders of magnitude: deriving efficient generators for closed simply-typed lambda terms and normal forms
• Combinatorics of \(\lambda\)-terms: a natural approach
• Deriving efficient sequential and parallel generators for closed simply-typed lambda terms and normal forms
• Quantitative Aspects of Linear and Affine Closed Lambda Terms

Cited in

(4)

• Statistical properties of lambda terms
• Deriving efficient sequential and parallel generators for closed simply-typed lambda terms and normal forms
• scientific article; zbMATH DE number 7455712 (Why is no real title available?)
• Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels

This page was built for publication: On uniquely closable and uniquely typable skeletons of lambda terms

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