Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers

DOI10.1017/S147106841700045XzbMath1425.68054arXiv1612.07682MaRDI QIDQ4603430

Maciej Bendkowski, Paul Tarau, Katarzyna Grygiel

Publication date: 20 February 2018

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

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

zbMATH Keywords

type inferenceBoltzmann samplerscombinatorics of {\(\lambda\)}-termsparallel implementation of Boltzmann samplersrandom generation of simply typed {\(\lambda\)}-termsrandom generation of simply typed normal forms

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic programming (68N17)

Related Items (3)

Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels ⋮ Unnamed Item ⋮ Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms

Uses Software

• GHC
• Automath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Natural Counting of Lambda Terms
• Pointed versus singular Boltzmann samplers: a comparative analysis
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Asymptotically almost all \lambda-terms are strongly normalizing
• Lambda terms of bounded unary height
• Counting and generating lambda terms

This page was built for publication: Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers