Giulio Guerrieri

Orcid: 0000-0002-0469-4279

According to our database1, Giulio Guerrieri authored at least 48 papers between 2014 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Meaningfulness and Genericity in a Subsuming Framework.
CoRR, 2024

Non-wellfounded parsimonious proofs and non-uniform complexity.
CoRR, 2024

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

Genericity Through Stratification.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

The Benefits of Diligence.
Proceedings of the Automated Reasoning - 12th International Joint Conference, 2024

Meaningfulness and Genericity in a Subsuming Framework (Invited Talk).
Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

Infinitary Cut-Elimination via Finite Approximations.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023
Quantitative Inhabitation for Different Lambda Calculi in a Unifying Framework.
Proc. ACM Program. Lang., January, 2023

Strong Call-by-Value and Multi Types.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2023, 2023

2022
On reduction and normalization in the computational core.
Math. Struct. Comput. Sci., August, 2022

The theory of call-by-value solvability.
Proc. ACM Program. Lang., 2022

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

The Theory of Call-by-Value Solvability (long version).
CoRR, 2022

Call-by-Value Solvability and Multi Types.
CoRR, 2022

Strategies for Asymptotic Normalization.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021
Semantic Bounds and Strong Call-by-Value Normalization.
CoRR, 2021

Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version).
CoRR, 2021

Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

Categorifying Non-Idempotent Intersection Types.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

A Deep Quantitative Type System.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

Factorize Factorization.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020
A Deep Inference System for Differential Linear Logic.
Proceedings of the Proceedings Second Joint International Workshop on Linearity & Trends in Linear Logic and Applications, 2020

Decomposing Probabilistic Lambda-Calculi.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

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

2019
Abstract machines for Open Call-by-Value.
Sci. Comput. Program., 2019

Postponement of $$\mathsf {raa}$$ raa and Glivenko's Theorem, Revisited.
Stud Logica, 2019

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

Types by Need (Extended Version).
CoRR, 2019

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

Crumbling Abstract Machines.
Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, 2019

Types by Need.
Proceedings of the Programming Languages and Systems, 2019

Factorization and Normalization, Essentially.
Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

2018
Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus.
Proceedings of the Proceedings Twelfth Workshop on Developments in Computational Models and Ninth Workshop on Intersection Types and Related Systems, 2018

The Bang Calculus and the Two Girard's Translations.
Proceedings of the Proceedings Joint International Workshop on Linearity & Trends in Linear Logic and Applications, 2018

Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus (Long Version).
CoRR, 2018

Types of Fireballs (Extended Version).
CoRR, 2018

Types of Fireballs.
Proceedings of the Programming Languages and Systems - 16th Asian Symposium, 2018

2017
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus.
Log. Methods Comput. Sci., 2017

Implementing Open Call-by-Value (Extended Version).
CoRR, 2017

Implementing Open Call-by-Value.
Proceedings of the Fundamentals of Software Engineering - 7th International Conference, 2017

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

Open Call-by-Value (Extended Version).
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

The Bang Calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value.
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, 2016

Open Call-by-Value.
Proceedings of the Programming Languages and Systems - 14th Asian Symposium, 2016

2015
Standardization of a Call-By-Value Lambda-Calculus.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

Head reduction and normalization in a call-by-value lambda-calculus.
Proceedings of the 2nd International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2015

2014
A Semantical and Operational Account of Call-by-Value Solvability.
Proceedings of the Foundations of Software Science and Computation Structures, 2014


  Loading...