Despite λ-calculus is now three quarters of a century old, no formula counting λ-terms has
been proposed yet, and the combinatorics of λ-calculus is considered a hard problem. The …

The problem we want to solve is how to generate all theorems of a given size in the
implicational fragment of propositional intuitionistic linear logic. We start by filtering for …

Contrary to several other families of lambda terms, no closed formula or generating function
is known and none of the sophisticated techniques devised in analytic combinatorics can …

We describe a Prolog-based combined lambda term generator and type-inferrer for closed
well-typed terms of a given size, in de Bruijn notation. By taking advantage of Prolog's …

A uniform representation, as binary trees with empty leaves, is given to expressions built
with Rosser's X-combinator, natural numbers, lambda terms and simple types. Type …

The given paper considers a problem of generating words of a context-dependent language.
It reviews the application of the problem to the unit testing of functions, examines in detail the …

We introduce a compressed de Bruijn representation of lambda terms and define its
bijections to standard representations. Compact combinatorial generation algorithms are …

Affine λ-terms are λ-terms in which each bound variable occurs at most once, and linear λ-
terms are λ-terms in which each bound variable occurs once and only once. In this article …

Programming or scripting languages used in real-world systems are seldom designed with a
formal semantics in mind from the outset. Therefore, the first step for developing well …

We introduce a compressed de Bruijn representation of lambda terms and define its
bijections to standard representations. Our compressed terms facilitate derivation of size …