Boltzmann samplers for random generation of lambda terms

Abstract : Randomly generating structured objects is important in testing and optimizing functional programs, whereas generating random $'l$-terms is more specifically needed for testing and optimizing compilers. For that a tool called QuickCheck has been proposed, but in this tool the control of the random generation is left to the programmer. Ten years ago, a method called Boltzmann samplers has been proposed to generate combinatorial structures. In this paper, we show how Boltzmann samplers can be developed to generate lambda-terms, but also other data structures like trees. These samplers rely on a critical value which parameters the main random selector and which is exhibited here with explanations on how it is computed. Haskell programs are proposed to show how samplers are actually implemented.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00979074
Contributor : Pierre Lescanne <>
Submitted on : Monday, April 28, 2014 - 12:26:15 PM
Last modification on : Friday, February 8, 2019 - 10:40:46 AM
Long-term archiving on : Monday, July 28, 2014 - 11:31:06 AM

Files

boltzmann.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-00979074, version 2
  • ARXIV : 1404.3875

Collections

Citation

Pierre Lescanne. Boltzmann samplers for random generation of lambda terms. 2014. ⟨ensl-00979074v2⟩

Share

Metrics

Record views

171

Files downloads

205