4 citations · 11 across the 4 of their papers we have counts for
4 papers
Proceedings International Workshop on Developments in Implicit Computational complExity
Patrick Baillot
This volume contains the proceedings of the International Workshop on Developments in Implicit Computational complExity (DICE 2010), which took place on March 27-28 2010 in Paphos,…
Safe Recursion on Notation into a Light Logic by Levels
Luca Roversi, Luca Vercelli
We embed Safe Recursion on Notation (SRN) into Light Affine Logic by Levels (LALL), derived from the logic L4. LALL is an intuitionistic deductive system, with a polynomial time cu…
On the complexity of stratified logics
Luca Vercelli
Our primary motivation is the comparison of two different traditions used in ICC to characterize the class FPTIME of the polynomial time computable functions. On one side, FPTIME c…
Taming Modal Impredicativity: Superlazy Reduction
Ugo Dal Lago, Luca Roversi, Luca Vercelli
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is considered as computation. We introduce modal impredicativity as a new form of impredicativi…