default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBeniamino Accattoli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c48]Beniamino Accattoli:
Semantic Bounds and Multi Types, Revisited. CSL 2024: 7:1-7:24- [c47]Beniamino Accattoli
, Adrienne Lancelot:
Light Genericity. FoSSaCS (2) 2024: 24-46 - [c46]Beniamino Accattoli, Adrienne Lancelot:
Mirroring Call-By-Need, or Values Acting Silly. FSCD 2024: 23:1-23:24 - [c45]Beniamino Accattoli, Claudio Sacerdoti Coen:
IMELL Cut Elimination with Linear Overhead. FSCD 2024: 24:1-24:24 - [i38]Beniamino Accattoli, Adrienne Lancelot:
Mirroring Call-by-Need, or Values Acting Silly. CoRR abs/2402.12078 (2024) - [i37]Beniamino Accattoli, Claudio Sacerdoti Coen:
IMELL Cut Elimination with Linear Overhead. CoRR abs/2405.03669 (2024) - [i36]Beniamino Accattoli, Adrienne Lancelot, Giulio Manzonetto, Gabriele Vanoni:
Interaction Equivalence. CoRR abs/2409.18709 (2024) - [i35]Beniamino Accattoli:
The Vanilla Sequent Calculus is Call-by-Value. CoRR abs/2409.19722 (2024) - 2023
- [j11]Beniamino Accattoli:
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic. Log. Methods Comput. Sci. 19(4) (2023) - [c44]Beniamino Accattoli, Pablo Barenbaum:
A Diamond Machine for Strong Evaluation. APLAS 2023: 69-90 - [c43]Beniamino Accattoli, Giulio Guerrieri, Maico Leberle:
Strong Call-by-Value and Multi Types. ICTAC 2023: 196-215 - [c42]Beniamino Accattoli, Horace Blanc, Claudio Sacerdoti Coen:
Formalizing Functions as Processes. ITP 2023: 5:1-5:21 - [c41]Beniamino Accattoli:
Sharing a Perspective on the λ-Calculus. Onward! 2023: 179-190 - [i34]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
A Log-Sensitive Encoding of Turing Machines in the λ-Calculus. CoRR abs/2301.12556 (2023) - [i33]Beniamino Accattoli, Claudia Faggian, Adrienne Lancelot:
Normal Form Bisimulations By Value. CoRR abs/2303.08161 (2023) - [i32]Beniamino Accattoli, Giulio Guerrieri, Maico Leberle:
Strong Call-by-Value and Multi Types. CoRR abs/2309.12261 (2023) - [i31]Beniamino Accattoli, Pablo Barenbaum:
A Diamond Machine For Strong Evaluation. CoRR abs/2309.12515 (2023) - [i30]Beniamino Accattoli:
Semantic Bound and Multi Types, Revisited. CoRR abs/2311.18233 (2023) - 2022
- [j10]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
Multi types and reasonable space. Proc. ACM Program. Lang. 6(ICFP): 799-825 (2022) - [j9]Beniamino Accattoli, Giulio Guerrieri:
The theory of call-by-value solvability. Proc. ACM Program. Lang. 6(ICFP): 855-885 (2022) - [c40]Beniamino Accattoli, Maico Leberle:
Useful Open Call-By-Need. CSL 2022: 4:1-4:21 - [c39]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
Reasonable Space for the λ-Calculus, Logarithmically. LICS 2022: 47:1-47:13 - [c38]Beniamino Accattoli:
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic. LICS 2022: 49:1-49:15 - [i29]Beniamino Accattoli, Giulio Guerrieri:
Call-by-Value Solvability and Multi Types. CoRR abs/2202.03079 (2022) - [i28]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
Reasonable Space for the λ-Calculus, Logarithmically. CoRR abs/2203.00362 (2022) - [i27]Beniamino Accattoli:
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic. CoRR abs/2205.15203 (2022) - [i26]Beniamino Accattoli, Giulio Guerrieri:
The Theory of Call-by-Value Solvability (long version). CoRR abs/2207.08697 (2022) - [i25]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
Multi Types and Reasonable Space (Long Version). CoRR abs/2207.08795 (2022) - 2021
- [j8]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The (In)Efficiency of interaction. Proc. ACM Program. Lang. 5(POPL): 1-33 (2021) - [c37]Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri:
Factorize Factorization. CSL 2021: 6:1-6:25 - [c36]Beniamino Accattoli, Andrea Condoluci, Claudio Sacerdoti Coen:
Strong Call-by-Value is Reasonable, Implosively. LICS 2021: 1-14 - [c35]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The Space of Interaction. LICS 2021: 1-13 - [i24]Beniamino Accattoli, Andrea Condoluci, Claudio Sacerdoti Coen:
Strong Call-by-Value is Reasonable, Implosively. CoRR abs/2102.06928 (2021) - [i23]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The Space of Interaction (long version). CoRR abs/2104.13795 (2021) - [i22]Beniamino Accattoli, Giulio Guerrieri, Maico Leberle:
Semantic Bounds and Strong Call-by-Value Normalization. CoRR abs/2104.13979 (2021) - [i21]Beniamino Accattoli, Maico Leberle:
Useful Open Call-by-Need. CoRR abs/2107.06591 (2021) - 2020
- [j7]Beniamino Accattoli, Stéphane Graham-Lengrand, Delia Kesner:
Tight typings and split bounds, fully developed. J. Funct. Program. 30: e14 (2020) - [c34]Beniamino Accattoli, Alejandro Díaz-Caro:
Functional Pearl: The Distributive λ-Calculus. FLOPS 2020: 33-49 - [c33]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The Machinery of Interaction. PPDP 2020: 4:1-4:15 - [i20]Ugo Dal Lago, Beniamino Accattoli, Gabriele Vanoni:
The Abstract Machinery of Interaction (Long Version). CoRR abs/2002.05649 (2020) - [i19]Beniamino Accattoli, Alejandro Díaz-Caro:
Functional Pearl: The Distributive λ-Calculus. CoRR abs/2002.07944 (2020) - [i18]Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri:
Factorize Factorization. CoRR abs/2005.01808 (2020) - [i17]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The (In)Efficiency of Interaction. CoRR abs/2010.12988 (2020)
2010 – 2019
- 2019
- [j6]Beniamino Accattoli, Giulio Guerrieri:
Abstract machines for Open Call-by-Value. Sci. Comput. Program. 184 (2019) - [c32]Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri:
Factorization and Normalization, Essentially. APLAS 2019: 159-180 - [c31]Beniamino Accattoli, Giulio Guerrieri, Maico Leberle:
Types by Need. ESOP 2019: 410-439 - [c30]Beniamino Accattoli, Andrea Condoluci, Giulio Guerrieri, Claudio Sacerdoti Coen:
Crumbling Abstract Machines. PPDP 2019: 4:1-4:15 - [c29]Andrea Condoluci, Beniamino Accattoli, Claudio Sacerdoti Coen:
Sharing Equality is Linear. PPDP 2019: 9:1-9:14 - [c28]Beniamino Accattoli:
A Fresh Look at the lambda-Calculus (Invited Talk). FSCD 2019: 1:1-1:20 - [e1]Beniamino Accattoli, Carlos Olarte:
Proceedings of the 13th Workshop on Logical and Semantic Frameworks with Applications, LSFA 2018, Fortaleza, Brazil, September 26-28, 2018. Electronic Notes in Theoretical Computer Science 344, Elsevier 2019 [contents] - [i16]Beniamino Accattoli, Giulio Guerrieri, Maico Leberle:
Types by Need (Extended Version). CoRR abs/1902.05945 (2019) - [i15]Beniamino Accattoli, Andrea Condoluci, Giulio Guerrieri, Claudio Sacerdoti Coen:
Crumbling Abstract Machines. CoRR abs/1907.06057 (2019) - [i14]Andrea Condoluci, Beniamino Accattoli, Claudio Sacerdoti Coen:
Sharing Equality is Linear. CoRR abs/1907.06101 (2019) - [i13]Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri:
Factorization and Normalization, Essentially. CoRR abs/1908.11289 (2019) - 2018
- [j5]Beniamino Accattoli, Stéphane Graham-Lengrand, Delia Kesner:
Tight typings and split bounds. Proc. ACM Program. Lang. 2(ICFP): 94:1-94:30 (2018) - [c27]Beniamino Accattoli, Giulio Guerrieri:
Types of Fireballs. APLAS 2018: 45-66 - [c26]Beniamino Accattoli:
Proof Nets and the Linear Substitution Calculus. ICTAC 2018: 37-61 - [c25]Beniamino Accattoli, Carlos Olarte:
Preface. LSFA 2018: 1-2 - [i12]Beniamino Accattoli, Stéphane Graham-Lengrand, Delia Kesner:
Tight Typings and Split Bounds. CoRR abs/1807.02358 (2018) - [i11]Beniamino Accattoli:
Proof Nets and the Linear Substitution Calculus. CoRR abs/1808.03395 (2018) - [i10]Beniamino Accattoli, Giulio Guerrieri:
Types of Fireballs (Extended Version). CoRR abs/1808.10389 (2018) - 2017
- [j4]Beniamino Accattoli, Claudio Sacerdoti Coen:
On the value of variables. Inf. Comput. 255: 224-242 (2017) - [c24]Beniamino Accattoli, Bruno Barras:
The Negligible and Yet Subtle Cost of Pattern Matching. APLAS 2017: 426-447 - [c23]Beniamino Accattoli, Giulio Guerrieri:
Implementing Open Call-by-Value. FSEN 2017: 1-19 - [c22]Beniamino Accattoli, Bruno Barras:
Environments and the complexity of abstract machines. PPDP 2017: 4-16 - [c21]Beniamino Accattoli:
(In)Efficiency and Reasonable Cost Models. LSFA 2017: 23-43 - [i9]Beniamino Accattoli, Giulio Guerrieri:
Implementing Open Call-by-Value (Extended Version). CoRR abs/1701.08186 (2017) - [i8]Ugo Dal Lago, Beniamino Accattoli:
Encoding Turing Machines into the Deterministic Lambda-Calculus. CoRR abs/1711.10078 (2017) - [i7]Beniamino Accattoli:
The Maximal MAM, a Reasonable Implementation of the Maximal Strategy. CoRR abs/1711.10301 (2017) - 2016
- [j3]Beniamino Accattoli, Ugo Dal Lago:
(Leftmost-Outermost) Beta Reduction is Invariant, Indeed. Log. Methods Comput. Sci. 12(1) (2016) - [c20]Beniamino Accattoli, Giulio Guerrieri:
Open Call-by-Value. APLAS 2016: 206-226 - [c19]Beniamino Accattoli:
The Useful MAM, a Reasonable Implementation of the Strong λ-Calculus. WoLLIC 2016: 1-21 - [c18]Beniamino Accattoli:
The Complexity of Abstract Machines. WPTE@FSCD 2016: 1-15 - [i6]Beniamino Accattoli, Giulio Guerrieri:
Open Call-by-Value (Extended Version). CoRR abs/1609.00322 (2016) - 2015
- [j2]Beniamino Accattoli:
Proof nets and the call-by-value λ-calculus. Theor. Comput. Sci. 606: 2-24 (2015) - [c17]Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza:
A Strong Distillery. APLAS 2015: 231-250 - [c16]Beniamino Accattoli, Claudio Sacerdoti Coen:
On the Relative Usefulness of Fireballs. LICS 2015: 141-155 - [i5]Beniamino Accattoli, Claudio Sacerdoti Coen:
On the Relative Usefulness of Fireballs. CoRR abs/1505.03791 (2015) - [i4]Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza:
A Strong Distillery. CoRR abs/1509.00996 (2015) - 2014
- [c15]Beniamino Accattoli, Ugo Dal Lago:
Beta reduction is invariant, indeed. CSL-LICS 2014: 8:1-8:10 - [c14]Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza:
Distilling abstract machines. ICFP 2014: 363-376 - [c13]Beniamino Accattoli, Eduardo Bonelli, Delia Kesner, Carlos Lombardi:
A nonstandard standardization theorem. POPL 2014: 659-670 - [c12]Beniamino Accattoli, Claudio Sacerdoti Coen:
On the Value of Variables. WoLLIC 2014: 36-50 - [i3]Beniamino Accattoli, Ugo Dal Lago:
Beta Reduction is Invariant, Indeed (Long Version). CoRR abs/1405.3311 (2014) - [i2]Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza:
Distilling Abstract Machines (Long Version). CoRR abs/1406.2370 (2014) - 2013
- [c11]Beniamino Accattoli:
Compressing Polarized Boxes. LICS 2013: 428-437 - [c10]Beniamino Accattoli:
Linear Logic and Strong Normalization. RTA 2013: 39-54 - [c9]Beniamino Accattoli:
Evaluating functions as processes. TERMGRAPH 2013: 41-55 - 2012
- [j1]Beniamino Accattoli, Delia Kesner:
Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus. Log. Methods Comput. Sci. 8(1) (2012) - [c8]Beniamino Accattoli:
Proof Pearl: Abella Formalization of λ-Calculus Cube Property. CPP 2012: 173-187 - [c7]Beniamino Accattoli, Luca Paolini:
Call-by-Value Solvability, Revisited. FLOPS 2012: 4-16 - [c6]Beniamino Accattoli, Delia Kesner:
The Permutative λ-Calculus. LPAR 2012: 23-36 - [c5]Beniamino Accattoli:
An Abstract Factorization Theorem for Explicit Substitutions. RTA 2012: 6-21 - [c4]Beniamino Accattoli, Ugo Dal Lago:
On the Invariance of the Unitary Cost Model for Head Reduction. RTA 2012: 22-37 - [c3]Beniamino Accattoli:
Proof nets and the call-by-value lambda-calculus. LSFA 2012: 11-26 - [i1]Beniamino Accattoli, Ugo Dal Lago:
On the Invariance of the Unitary Cost Model for Head Reduction (Long Version). CoRR abs/1202.1641 (2012) - 2010
- [c2]Beniamino Accattoli, Delia Kesner:
The Structural lambda-Calculus. CSL 2010: 381-395
2000 – 2009
- 2009
- [c1]Beniamino Accattoli, Stefano Guerrini:
Jumping Boxes. CSL 2009: 55-70
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
