Preprints, Working Papers, ... Year : 2011

On counting untyped lambda terms

Pierre Lescanne
Laboratoire de l'Informatique du Parallélisme
CV

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.

Domains

Data Structures and Algorithms [cs.DS] Logic in Computer Science [cs.LO]
Fichier principal
Vignette du fichier
Lescanne_counting_lambda_terms.pdf (199 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Pierre Lescanne  : Connect in order to contact the contributor

https://ens-lyon.hal.science/ensl-00578527

Submitted on : Thursday, October 20, 2011-6:26:02 PM

Last modification on : Tuesday, November 12, 2024-3:20:06 PM

Long-term archiving on : Saturday, January 21, 2012-2:35:39 AM

Download

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. 2011. ⟨ensl-00578527v7⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite
405 View
644 Download

Altmetric

Share

More