
Implicit automata in typed λcalculi II: streaming transducers vs categorical semantics
We characterize regular string transductions as programs in a linear λc...
read it

Complexity of correctness for pomset logic proof nets
We show that it is coNPcomplete to decide whether a given proof structu...
read it

Proof nets through the lens of graph theory: a compilation of remarks
This document is intended to eventually gather a few small remarks on th...
read it

When lattice cubes meet affine subspaces: a short note
We give short and simple proofs of what seem to be folklore results: * t...
read it

On the Elementary Affine LambdaCalculus with and Without Fixed Points
The elementary affine lambdacalculus was introduced as a polyvalent set...
read it

Typed lambdacalculi and superclasses of regular functions
We propose to use Church encodings in typed lambdacalculi as the basis ...
read it

Coherent Interaction Graphs
We introduce the notion of coherent graphs, and show how those can be us...
read it

Around finite secondorder coherence spaces
Many applications of denotational semantics, such as higherorder model ...
read it

Finite semantics of polymorphism, complexity and the power of type fixpoints
Many applications of denotational semantics, such as higherorder model ...
read it

Unique perfect matchings, edgecolored graphs and proof nets for linear logic with Mix
This paper establishes a bridge between linear logic and mainstream grap...
read it

Constrained pathfinding and structure from acyclicity
This note presents several results in graph theory inspired by the autho...
read it
Lê Thành Dũng Nguyên
is this you? claim profile