A fundamental theme in automata theory is regular languages of words and...
We consider the following decision problem: given two simply typed
λ-ter...
Polyregular functions are the class of string-to-string functions defina...
We characterize regular string transductions as programs in a linear
λ-c...
We show that it is coNP-complete to decide whether a given proof structu...
This document is intended to eventually gather a few small remarks on th...
We give short and simple proofs of what seem to be folklore results: * t...
The elementary affine lambda-calculus was introduced as a polyvalent set...
We propose to use Church encodings in typed lambda-calculi as the basis ...
We introduce the notion of coherent graphs, and show how those can be us...
Many applications of denotational semantics, such as higher-order model
...
Many applications of denotational semantics, such as higher-order model
...
This paper establishes a bridge between linear logic and mainstream grap...
This note presents several results in graph theory inspired by the autho...