Katarzyna Grygiel

Isabella Larcher

Discret. Math. Theor. Comput. Sci., 2021

2018

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

[BibT_eX]

[DOI]

Paul Tarau

Theory Pract. Log. Program., 2018

2017

On the likelihood of normalization in combinatory logic.

[BibT_eX]

[DOI]

J. Log. Comput., 2017

Combinatorics of $$\lambda$$-terms: a natural approach.

[BibT_eX]

[DOI]

J. Log. Comput., 2017

Boltzmann Samplers for Closed Simply-Typed Lambda Terms.

[BibT_eX]

[DOI]

Paul Tarau

Proceedings of the Practical Aspects of Declarative Languages, 2017

2016

On the likelihood of normalisation in combinatory logic.

[BibT_eX]

[DOI]

CoRR, 2016

Combinatorics of λ-terms: a natural approach.

[BibT_eX]

[DOI]

CoRR, 2016

A Natural Counting of Lambda Terms.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015

Counting and generating terms in the binary lambda calculus.

[BibT_eX]

[DOI]

J. Funct. Program., 2015

Counting and Generating Terms in the Binary Lambda Calculus (Extended version).

[BibT_eX]

[DOI]

CoRR, 2015

Asymptotic Properties of Combinatory Logic.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2015

2014

Counting Terms in the Binary Lambda Calculus.

[BibT_eX]

[DOI]

CoRR, 2014

2013

How big is BCI fragment of BCK logic.

[BibT_eX]

[DOI]

Pawel M. Idziak

J. Log. Comput., 2013

Counting and generating lambda terms.

[BibT_eX]

[DOI]