Lorenzo Tortora de Falco

Orcid: 0000-0002-3987-1095

According to our database1, Lorenzo Tortora de Falco authored at least 24 papers between 1996 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Confluence for Proof-Nets via Parallel Cut Elimination.
Proceedings of the LPAR 2024: Proceedings of 25th Conference on Logic for Programming, 2024

2023
Linear Realisability Over Nets and Second Order Quantification (short paper).
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2022
Gluing resource proof-structures: inhabitation and inverting the Taylor expansion.
Log. Methods Comput. Sci., 2022

2020
Glueability of Resource Proof-Structures: Inverting the Taylor Expansion.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019
Glueability of resource proof-structures: inverting the Taylor expansion (long version).
CoRR, 2019

Finite semantics of polymorphism, complexity and the power of type fixpoints.
CoRR, 2019

Proof-Net as Graph, Taylor Expansion as Pullback.
Proceedings of the Logic, Language, Information, and Computation, 2019

2018
Preface.
Math. Struct. Comput. Sci., 2018

2016
A semantic account of strong normalization in linear logic.
Inf. Comput., 2016

Relational type-checking for MELL proof-structures. Part 1: Multiplicatives.
CoRR, 2016

Computing Connected Proof(-Structure)s From Their Taylor Expansion.
Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

2015
An abstract approach to stratification in linear logic.
Inf. Comput., 2015

2012
The relational model is injective for multiplicative exponential linear logic (without weakenings).
Ann. Pure Appl. Log., 2012

2011
A semantic measure of the execution time in linear logic.
Theor. Comput. Sci., 2011

2010
Strong normalization property for second order linear logic.
Theor. Comput. Sci., 2010

2006
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2005
Polarized and focalized linear and classical proofs.
Ann. Pure Appl. Log., 2005

2003
Additives of linear logic and normalization - Part I: a (restricted) Church-Rosser property.
Theor. Comput. Sci., 2003

Obsessional Experiments For Linear Logic Proof-Nets.
Math. Struct. Comput. Sci., 2003

The additive mutilboxes.
Ann. Pure Appl. Log., 2003

2002
SN and CR for Free-Style LK<sup>tq</sup>: Linear Decorations and Simulation of Normalization.
J. Symb. Log., 2002

1997
Denotational Semantics for Polarized (But-non-constrainted) LK by Means of the Additives.
Proceedings of the Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, 1997

1996
Generalized standardization lemma for the additives.
Proceedings of the Linear Logic Tokyo Meeting 1996, Keio University, Mita Campus, Tokyo, Japan, March 29, 1996

Strong Normalization for All-Style LK.
Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1996


  Loading...