Giulio Manzonetto

Orcid: 0000-0003-1448-9014

According to our database1, Giulio Manzonetto authored at least 42 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Why Are Proofs Relevant in Proof-Relevant Models?
Proc. ACM Program. Lang., January, 2023

Extended Addressing Machines, explicit substitutions, PCF, definability, full abstraction.
CoRR, 2023

A Lambda Calculus Satellite (Invited Talk).
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022
Addressing Machines as models of lambda-calculus.
Log. Methods Comput. Sci., 2022

Extended Addressing Machines for PCF, with Explicit Substitutions.
Proceedings of the 38th Conference on the Mathematical Foundations of Programming Semantics, 2022

A Lambda Calculus Satellite.
College Publications, ISBN: 978-1-84890-415-6, 2022

2021
Call-By-Value, Again!
Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

2020
Taylor subsumes Scott, Berry, Kahn and Plotkin.
Proc. ACM Program. Lang., 2020

Revisiting Call-by-value Böhm trees in light of their Taylor expansion.
Log. Methods Comput. Sci., 2020

2019
The fixed point property and a technique to harness double fixed point combinators.
J. Log. Comput., 2019

Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture.
Log. Methods Comput. Sci., 2019

New Semantical Insights Into Call-by-Value λ-Calculus.
Fundam. Informaticae, 2019

2018
Relational Graph Models at Work.
Log. Methods Comput. Sci., 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

2017
Refutation of Sallé's Longstanding Conjecture.
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

2016
New Results on Morris's Observational Theory: The Benefits of Separating the Inseparable.
Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

Factor Varieties and Symbolic Computation.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2014
Relational Graph Models, Taylor Expansion and Extensionality.
Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

2013
Constructing differential categories and deconstructing categories of games.
Inf. Comput., 2013

Weighted Relational Models of Typed Lambda-Calculi.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Call-by-Value Non-determinism in a Linear Logic Type Discipline.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

2012
Strong normalization of ML<sup>F</sup> via a calculus of coercions.
Theor. Comput. Sci., 2012

What is a categorical model of the differential and the resource λ-calculi?
Math. Struct. Comput. Sci., 2012

Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion
Log. Methods Comput. Sci., 2012

A relational semantics for parallelism and non-determinism in a functional setting.
Ann. Pure Appl. Log., 2012

Loader and Urzyczyn Are Logically Related.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Böhm's Theorem for Resource Lambda Calculus through Taylor Expansion.
Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

Full Abstraction for Resource Calculus with Tests.
Proceedings of the Computer Science Logic, 2011

2010
Applying Universal Algebra to Lambda Calculus.
J. Log. Comput., 2010

Categorical Models for Simply Typed Resource Calculi.
Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

What is a categorical model of the differential and the resource lambda-calculi?
CoRR, 2010

Harnessing ML<sup>F</sup> with the Power of System F.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009
Effective lambda-models versus recursively enumerable lambda-theories.
Math. Struct. Comput. Sci., 2009

Models and theories of lambda calculus
CoRR, 2009

A General Class of Models of H<sup>*</sup>.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

A Relational Model of a Parallel and Non-deterministic lambda-Calculus.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

2008
Models and theories of lambda calculus.
PhD thesis, 2008

Effective lambda-models vs recursively enumerable lambda-theories
CoRR, 2008

From lambda-Calculus to Universal Algebra and Back.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007
Not Enough Points Is Enough.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

Lambda Theories of Effective Lambda Models.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
Boolean Algebras for Lambda Calculus.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006


  Loading...