Maciej Bendkowski

activity

20162020

most citedHow to generate random lambda terms?

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing cs.LOShow all

3 papers · 1 filter

cs.LO2018

Towards the average-case analysis of substitution resolution in $λ$ -calculus

Maciej Bendkowski

Substitution resolution supports the computational character of $β$ -reduction, complementing its execution with a capture-avoiding exchange of terms for bound variables. Alas, the…

cs.LO2018

Combinatorics of explicit substitutions

Maciej Bendkowski, Pierre Lescanne

$λ υ$ is an extension of the $λ$ -calculus which internalises the calculus of substitutions. In the current paper, we investigate the combinatorial properties of $λ υ$ f…

cs.LO2016

Normal-order reduction grammars

Maciej Bendkowski

We present an algorithm which, for given $n$ , generates an unambiguous regular tree grammar defining the set of combinatory logic terms, over the set ${S, K}$ of primitive combina…

Towards the average-case analysis of substitution resolution in λ-calculus

Combinatorics of explicit substitutions

Normal-order reduction grammars

Towards the average-case analysis of substitution resolution in $λ$ -calculus