We present the stellar resolution, a "flexible" tile system based on
Rob...
This work explores an unexpected application of Implicit Computational
C...
This abstract aims at presenting an ongoing effort to apply a novel typi...
Implicit Computational Complexity (ICC) drives better understanding of
c...
Polynomial functors are a categorical generalization of the usual notion...
Abstract. We present a tool to automatically perform the data-size analy...
We improve and refine a method for certifying that the values' sizes com...
We present a new asynchronous model of computation named Stellar Resolut...
We give an account of Agafonov's original proof of his eponymous theorem...
This paper presents a new abstract method for proving lower bounds in
co...
In a recent paper, the author has shown how Interaction Graphs models fo...
In a series of papers, the author introduced models of linear logic know...
These proceedings present the accepted regular papers and some selected
...
We introduce the notion of coherent graphs, and show how those can be us...
Many applications of denotational semantics, such as higher-order model
...
Finding lower bounds in complexity theory has proven to be an extremely
...
Following previous work on CCS, we propose a compositional model for the...