On counting untyped lambda terms - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2013

On counting untyped lambda terms

Abstract

We present several results on counting untyped lambda terms, i.e., on telling how many terms belong to such or such class, according to the size of the terms and/or to the number of free variables.
Fichier principal
Vignette du fichier
Lescanne_counting_lambda_terms.pdf (220.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00578527 , version 1 (21-03-2011)
ensl-00578527 , version 2 (22-03-2011)
ensl-00578527 , version 3 (27-06-2011)
ensl-00578527 , version 4 (07-07-2011)
ensl-00578527 , version 5 (08-08-2011)
ensl-00578527 , version 6 (30-09-2011)
ensl-00578527 , version 7 (20-10-2011)
ensl-00578527 , version 8 (16-02-2012)
ensl-00578527 , version 9 (05-10-2012)

Identifiers

Cite

Pierre Lescanne. On counting untyped lambda terms. Theoretical Computer Science, 2013, 474, pp.80-97. ⟨10.1016/j.tcs.2012.11.019⟩. ⟨ensl-00578527v9⟩
237 View
549 Download

Altmetric

Share

Gmail Facebook X LinkedIn More