Boltzmann samplers for random generation of lambda terms - ENS de Lyon - École normale supérieure de Lyon Access content directly
Preprints, Working Papers, ... Year :

Boltzmann samplers for random generation of lambda terms


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.
Fichier principal
Vignette du fichier
boltzmann.pdf (301 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

ensl-00979074 , version 1 (15-04-2014)
ensl-00979074 , version 2 (28-04-2014)



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



Gmail Facebook Twitter LinkedIn More