13 citations · 19 across the 7 of their papers we have counts for
9 papers
Random generation of closed simply-typed -terms: a synergy between logic programming and Boltzmann samplers
Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau
A natural approach to software quality assurance consists in writing unit tests securing programmer-declared code invariants. Throughout the literature a great body of work has bee…
Combinatorics of -terms: a natural approach
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne +1
We consider combinatorial aspects of -terms in the model based on de Bruijn indices where each building constructor is of size one. Surprisingly, the counting sequence for -t…
On the likelihood of normalisation in combinatory logic
Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc
We present a quantitative basis-independent analysis of combinatory logic. Using a general argument regarding plane binary trees with labelled leaves, we generalise the results of…
Counting and Generating Terms in the Binary Lambda Calculus (Extended version)
Katarzyna Grygiel, Pierre Lescanne
In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study…
A natural counting of lambda terms
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne +1
We study the sequences of numbers corresponding to lambda terms of given sizes, where the size is this of lambda terms with de Bruijn indices in a very natural model where all the…
Counting Terms in the Binary Lambda Calculus
Katarzyna Grygiel, Pierre Lescanne
In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study…
Distributive lattices determined by weighted double skeletons
Gábor Czédli, Joanna Grygiel, Katarzyna Grygiel
Related to his S-glued sum construction, the skeleton S(L) of a finite lattice L was introduced by C. Herrmann in 1973. Our theorem asserts that if D is a finite distributive latti…
Counting and generating lambda terms
Katarzyna Grygiel, Pierre Lescanne
Lambda calculus is the basis of functional programming and higher order proof assistants. However, little is known about combinatorial properties of lambda terms, in particular, ab…
How big is BCI fragment of BCK logic
Katarzyna Grygiel, Pawel M. Idziak, Marek Zaionc
We investigate quantitative properties of BCI and BCK logics. The first part of the paper compares the number of formulas provable in BCI versus BCK logics. We consider formulas bu…