Beniamino Accattoli

According to our database, Beniamino Accattoli authored at least 78 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Reasonable Space for the ${\lambda}$-Calculus, Logarithmically.

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

Log. Methods Comput. Sci., 2024

The Vanilla Sequent Calculus is Call-by-Value.

Beniamino Accattoli

CoRR, 2024

Interaction Equivalence.

Beniamino Accattoli, Adrienne Lancelot, Giulio Manzonetto, Gabriele Vanoni

CoRR, 2024

Mirroring Call-By-Need, or Values Acting Silly.

Beniamino Accattoli, Adrienne Lancelot

Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

IMELL Cut Elimination with Linear Overhead.

Beniamino Accattoli, Claudio Sacerdoti Coen

Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

Light Genericity.

Beniamino Accattoli, Adrienne Lancelot

Proceedings of the Foundations of Software Science and Computation Structures, 2024

Semantic Bounds and Multi Types, Revisited.

Beniamino Accattoli

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic.

Beniamino Accattoli

Log. Methods Comput. Sci., 2023

Semantic Bound and Multi Types, Revisited.

Beniamino Accattoli

CoRR, 2023

Normal Form Bisimulations By Value.

Beniamino Accattoli, Claudia Faggian, Adrienne Lancelot

CoRR, 2023

A Log-Sensitive Encoding of Turing Machines in the λ-Calculus.

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

CoRR, 2023

Sharing a Perspective on the λ-Calculus.

Beniamino Accattoli

Proceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, 2023

Formalizing Functions as Processes.

Beniamino Accattoli, Horace Blanc, Claudio Sacerdoti Coen

Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

Strong Call-by-Value and Multi Types.

Beniamino Accattoli, Giulio Guerrieri, Maico Leberle

Proceedings of the Theoretical Aspects of Computing - ICTAC 2023, 2023

A Diamond Machine for Strong Evaluation.

Beniamino Accattoli, Pablo Barenbaum

Proceedings of the Programming Languages and Systems - 21st Asian Symposium, 2023

2022

Multi types and reasonable space.

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

Proc. ACM Program. Lang., 2022

The theory of call-by-value solvability.

Beniamino Accattoli, Giulio Guerrieri

Proc. ACM Program. Lang., 2022

Multi Types and Reasonable Space (Long Version).

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

CoRR, 2022

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

Beniamino Accattoli, Giulio Guerrieri

CoRR, 2022

Call-by-Value Solvability and Multi Types.

Beniamino Accattoli, Giulio Guerrieri

CoRR, 2022

Reasonable Space for the λ-Calculus, Logarithmically.

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Useful Open Call-By-Need.

Beniamino Accattoli, Maico Leberle

Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

2021

The (In)Efficiency of interaction.

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

Proc. ACM Program. Lang., 2021

Semantic Bounds and Strong Call-by-Value Normalization.

Beniamino Accattoli, Giulio Guerrieri, Maico Leberle

CoRR, 2021

The Space of Interaction (long version).

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

CoRR, 2021

The Space of Interaction.

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Strong Call-by-Value is Reasonable, Implosively.

Beniamino Accattoli, Andrea Condoluci, Claudio Sacerdoti Coen

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Factorize Factorization.

Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri

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

2020

Tight typings and split bounds, fully developed.

Beniamino Accattoli, Stéphane Graham-Lengrand, Delia Kesner

J. Funct. Program., 2020

The Abstract Machinery of Interaction (Long Version).

Ugo Dal Lago, Beniamino Accattoli, Gabriele Vanoni

CoRR, 2020

The Machinery of Interaction.

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

Proceedings of the PPDP '20: 22nd International Symposium on Principles and Practice of Declarative Programming, 2020

Functional Pearl: The Distributive λ-Calculus.

Beniamino Accattoli, Alejandro Díaz-Caro

Proceedings of the Functional and Logic Programming - 15th International Symposium, 2020

2019

Abstract machines for Open Call-by-Value.

Beniamino Accattoli, Giulio Guerrieri

Sci. Comput. Program., 2019

Types by Need (Extended Version).

Beniamino Accattoli, Giulio Guerrieri, Maico Leberle

CoRR, 2019

A Fresh Look at the lambda-Calculus (Invited Talk).

Beniamino Accattoli

Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

Sharing Equality is Linear.

Andrea Condoluci, Beniamino Accattoli, Claudio Sacerdoti Coen

Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, 2019

Crumbling Abstract Machines.

Beniamino Accattoli, Andrea Condoluci, Giulio Guerrieri, Claudio Sacerdoti Coen

Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, 2019

Types by Need.

Beniamino Accattoli, Giulio Guerrieri, Maico Leberle

Proceedings of the Programming Languages and Systems, 2019

Factorization and Normalization, Essentially.

Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri

Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

2018

Tight typings and split bounds.

Beniamino Accattoli, Stéphane Graham-Lengrand, Delia Kesner

Proc. ACM Program. Lang., 2018

Preface.

Beniamino Accattoli, Carlos Olarte

Proceedings of the 13th Workshop on Logical and Semantic Frameworks with Applications, 2018

Types of Fireballs (Extended Version).

Beniamino Accattoli, Giulio Guerrieri

CoRR, 2018

Proof Nets and the Linear Substitution Calculus.

Beniamino Accattoli

Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

Types of Fireballs.

Beniamino Accattoli, Giulio Guerrieri

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

2017

On the value of variables.

Beniamino Accattoli, Claudio Sacerdoti Coen

Inf. Comput., 2017

(In)Efficiency and Reasonable Cost Models.

Beniamino Accattoli

Proceedings of the 12th Workshop on Logical and Semantic Frameworks, with Applications, 2017

The Maximal MAM, a Reasonable Implementation of the Maximal Strategy.

Beniamino Accattoli

CoRR, 2017

Encoding Turing Machines into the Deterministic Lambda-Calculus.

Ugo Dal Lago, Beniamino Accattoli

CoRR, 2017

Implementing Open Call-by-Value (Extended Version).

Beniamino Accattoli, Giulio Guerrieri

CoRR, 2017

Environments and the complexity of abstract machines.

Beniamino Accattoli, Bruno Barras

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09, 2017

Implementing Open Call-by-Value.

Beniamino Accattoli, Giulio Guerrieri

Proceedings of the Fundamentals of Software Engineering - 7th International Conference, 2017

The Negligible and Yet Subtle Cost of Pattern Matching.

Beniamino Accattoli, Bruno Barras

Proceedings of the Programming Languages and Systems - 15th Asian Symposium, 2017

2016

(Leftmost-Outermost) Beta Reduction is Invariant, Indeed.

Beniamino Accattoli, Ugo Dal Lago

Log. Methods Comput. Sci., 2016

Open Call-by-Value (Extended Version).

Beniamino Accattoli, Giulio Guerrieri

CoRR, 2016

The Complexity of Abstract Machines.

Beniamino Accattoli

Proceedings of the Proceedings Third International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2016

The Useful MAM, a Reasonable Implementation of the Strong λ-Calculus.

Beniamino Accattoli

Proceedings of the Logic, Language, Information, and Computation, 2016

Open Call-by-Value.

Beniamino Accattoli, Giulio Guerrieri

Proceedings of the Programming Languages and Systems - 14th Asian Symposium, 2016

2015

Proof nets and the call-by-value λ-calculus.

Beniamino Accattoli

Theor. Comput. Sci., 2015

On the Relative Usefulness of Fireballs.

Beniamino Accattoli, Claudio Sacerdoti Coen

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

A Strong Distillery.

Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza

Proceedings of the Programming Languages and Systems - 13th Asian Symposium, 2015

2014

Beta Reduction is Invariant, Indeed (Long Version).

Beniamino Accattoli, Ugo Dal Lago

CoRR, 2014

Distilling Abstract Machines (Long Version).

Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza

CoRR, 2014

A nonstandard standardization theorem.

Beniamino Accattoli, Eduardo Bonelli, Delia Kesner, Carlos Lombardi

Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Distilling abstract machines.

Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza

Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

Beta reduction is invariant, indeed.

Beniamino Accattoli, Ugo Dal Lago

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

Evaluating functions as processes

Beniamino Accattoli

Proceedings of the Proceedings 7th International Workshop on Computing with Terms and Graphs, 2013

Linear Logic and Strong Normalization.

Beniamino Accattoli

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Compressing Polarized Boxes.

Beniamino Accattoli

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012

Proof nets and the call-by-value lambda-calculus

Beniamino Accattoli

Proceedings of the Proceedings Seventh Workshop on Logical and Semantic Frameworks, 2012

Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus

Beniamino Accattoli, Delia Kesner

Log. Methods Comput. Sci., 2012

On the Invariance of the Unitary Cost Model for Head Reduction (Long Version)

Beniamino Accattoli, Ugo Dal Lago

CoRR, 2012

On the Invariance of the Unitary Cost Model for Head Reduction.

Beniamino Accattoli, Ugo Dal Lago

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

An Abstract Factorization Theorem for Explicit Substitutions.

Beniamino Accattoli

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

The Permutative λ-Calculus.

Beniamino Accattoli, Delia Kesner

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

Call-by-Value Solvability, Revisited.

Beniamino Accattoli, Luca Paolini

Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

Proof Pearl: Abella Formalization of λ-Calculus Cube Property.

Beniamino Accattoli

Proceedings of the Certified Programs and Proofs - Second International Conference, 2012

2010

The Structural <i>lambda</i>-Calculus.

Beniamino Accattoli, Delia Kesner

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009

Jumping Boxes.

Beniamino Accattoli, Stefano Guerrini

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009