default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEduardo Bonelli
Person information
- affiliation: National University of La Plata, Argentina
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Eduardo Bonelli, Delia Kesner, Andrés Viso:
A Strong Bisimulation for a Classical Term Calculus. Log. Methods Comput. Sci. 20(2) (2024)- 2023
- [c28]Pablo Barenbaum, Eduardo Bonelli:
Reductions in Higher-Order Rewriting and Their Equivalence. CSL 2023: 8:1-8:18 - 2022
- [e3]Mauricio Ayala-Rincón, Eduardo Bonelli:
Proceedings 16th Logical and Semantic Frameworks with Applications, LSFA 2021, Buenos Aires, Argentina (Online), 23rd - 24th July, 2021. EPTCS 357, 2022 [contents] - [i6]Pablo Barenbaum, Eduardo Bonelli:
Reductions in Higher-Order Rewriting and Their Equivalence. CoRR abs/2210.15654 (2022) - 2021
- [i5]Eduardo Bonelli, Delia Kesner, Andrés Viso:
A Strong Bisimulation for Control Operators by Means of Multiplicative and Exponential Reduction. CoRR abs/2101.05754 (2021) - 2020
- [c27]Delia Kesner, Eduardo Bonelli, Andrés Viso
:
Strong Bisimulation for Control Operators (Invited Talk). CSL 2020: 4:1-4:23 - [c26]Pablo Barenbaum, Eduardo Bonelli:
Rewrites as Terms through Justification Logic. PPDP 2020: 11:1-11:13
2010 – 2019
- 2019
- [j13]Mauricio Ayala-Rincón, Eduardo Bonelli, Juan Edi, Andrés Viso:
Typed path polymorphism. Theor. Comput. Sci. 781: 111-130 (2019) - [i4]Eduardo Bonelli, Delia Kesner, Andrés Viso:
Strong Bisimulation for Control Operators. CoRR abs/1906.09370 (2019) - 2018
- [j12]Francisco Bavera, Eduardo Bonelli:
Justification logic and audited computation. J. Log. Comput. 28(5): 909-934 (2018) - [c25]Pablo Barenbaum, Eduardo Bonelli, Kareem Mohamed:
Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need: Extended Abstract. PPDP 2018: 6:1-6:12 - 2017
- [j11]Gabriela Steren, Eduardo Bonelli:
The first-order hypothetical logic of proofs. J. Log. Comput. 27(4): 1023-1066 (2017) - [j10]Thibaut Balabonski, Pablo Barenbaum, Eduardo Bonelli, Delia Kesner:
Foundations of strong call by need. Proc. ACM Program. Lang. 1(ICFP): 20:1-20:29 (2017) - [j9]Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos:
On abstract normalisation beyond neededness. Theor. Comput. Sci. 672: 36-63 (2017) - [c24]Pablo Barenbaum, Eduardo Bonelli:
Optimality and the Linear Substitution Calculus. FSCD 2017: 9:1-9:16 - [i3]Juan Edi, Andrés Viso, Eduardo Bonelli:
Efficient Type Checking for Path Polymorphism. CoRR abs/1704.09026 (2017) - 2016
- [i2]Andrés Viso, Eduardo Bonelli, Mauricio Ayala-Rincón:
Type Soundness for Path Polymorphism. CoRR abs/1601.03271 (2016) - 2015
- [c23]Juan Edi, Andrés Viso, Eduardo Bonelli:
Efficient Type Checking for Path Polymorphism. TYPES 2015: 6:1-6:23 - [c22]Andrés Viso, Eduardo Bonelli, Mauricio Ayala-Rincón:
Type Soundness for Path Polymorphism. LSFA 2015: 235-251 - 2014
- [j8]Eduardo Bonelli, Gabriela Steren:
Hypothetical Logic of Proofs. Logica Universalis 8(1): 103-140 (2014) - [c21]Beniamino Accattoli, Eduardo Bonelli, Delia Kesner, Carlos Lombardi:
A nonstandard standardization theorem. POPL 2014: 659-670 - [e2]Mauricio Ayala-Rincón, Eduardo Bonelli, Ian Mackie:
Proceedings 9th International Workshop on Developments in Computational Models, DCM 2013, Buenos Aires, Argentina, 26 August 2013. EPTCS 144, 2014 [contents] - [i1]Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos:
An abstract normalisation result with applications to non-sequential calculi. CoRR abs/1412.2118 (2014) - 2013
- [c20]Gabriela Steren, Eduardo Bonelli:
Intuitionistic Hypothetical Logic of Proofs. IMLA@UNILOG 2013: 89-103 - 2012
- [j7]Eduardo Bonelli, Federico Feller:
Justification Logic as a foundation for certifying mobile computation. Ann. Pure Appl. Log. 163(7): 935-950 (2012) - [c19]Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos:
Normalisation for Dynamic Pattern Calculi. RTA 2012: 117-132 - [c18]Adriana B. Compagnoni, Vishakha Sharma, Yifei Bao, Matthew Libera, Svetlana Sukhishvili, Philippe Bidinger, Livio Bioglio, Eduardo Bonelli:
BioScape: A Modeling and Simulation Language for Bacteria-Materials Interactions. CS2Bio 2012: 35-49 - 2011
- [c17]Luciano Bello, Eduardo Bonelli:
On-the-Fly Inlining of Dynamic Dependency Monitors for Secure Information Flow. Formal Aspects in Security and Trust 2011: 55-69 - 2010
- [c16]Francisco Bavera, Eduardo Bonelli:
Justification Logic and History Based Computation. ICTAC 2010: 337-351 - [e1]Eduardo Bonelli:
Proceedings 5th International Workshop on Higher-Order Rewriting, HOR 2010, Edinburgh, UK, July 14, 2010. EPTCS 49, 2010 [contents]
2000 – 2009
- 2009
- [c15]Eduardo Bonelli, Federico Feller:
The Logic of Proofs as a Foundation for Certifying Mobile Computation. LFCS 2009: 76-91 - [c14]Eduardo Bonelli, Pablo Barenbaum:
Superdevelopments for Weak Reduction. WRS 2009: 20-31 - 2008
- [c13]Francisco Bavera, Eduardo Bonelli:
Type-based information flow analysis for bytecode languages with variable object field policies. SAC 2008: 347-351 - 2007
- [j6]Pablo Garralda, Eduardo Bonelli, Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini:
Boxed ambients with communication interfaces. Math. Struct. Comput. Sci. 17(4): 587-645 (2007) - [c12]Sergei N. Artëmov, Eduardo Bonelli:
The Intensional Lambda Calculus. LFCS 2007: 12-25 - [c11]Eduardo Bonelli, Adriana B. Compagnoni:
Multipoint Session Types for a Distributed Calculus. TGC 2007: 240-256 - 2006
- [c10]Eduardo Bonelli:
The Linear Logical Abstract Machine. MFPS 2006: 99-121 - 2005
- [j5]Eduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter:
Correspondence assertions for process synchronization in concurrent communications. J. Funct. Program. 15(2): 219-247 (2005) - [j4]Eduardo Bonelli, Delia Kesner, Alejandro Ríos:
de Bruijn Indices for Metaterms. J. Log. Comput. 15(6): 855-899 (2005) - [j3]Eduardo Bonelli, Delia Kesner, Alejandro Ríos:
Relating Higher-order and First-order Rewriting. J. Log. Comput. 15(6): 901-947 (2005) - [j2]Eduardo Bonelli:
Normalisation for higher-order calculi with explicit substitutions. Theor. Comput. Sci. 333(1-2): 91-125 (2005) - [c9]Eduardo Bonelli, Adriana B. Compagnoni, Ricardo H. Medel:
Information Flow Analysis for a Typed Assembly Language with Polymorphic Stacks. CASSIS 2005: 37-56 - [c8]Ricardo H. Medel, Adriana B. Compagnoni, Eduardo Bonelli:
A Typed Assembly Language for Non-interference. ICTCS 2005: 360-374 - 2004
- [c7]Eduardo Bonelli, Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini, Pablo Garralda:
Boxed Ambients with Communication Interfaces. MFCS 2004: 119-148 - [c6]Eduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter:
Typechecking Safe Process Synchronization. FGUC 2004: 3-22 - 2003
- [c5]Eduardo Bonelli:
A Normalisation Result for Higher-Order Calculi with Explicit Substitutions. FoSSaCS 2003: 153-168 - [c4]Eduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter:
Correspondence Assertions for Process Synchronization in Concurrent Communications. FOCLASA 2003: 175-195 - 2001
- [j1]Eduardo Bonelli:
Perpetuality in a named lambda calculus with explicit substitutions. Math. Struct. Comput. Sci. 11(1): 47-90 (2001) - [c3]Eduardo Bonelli, Delia Kesner, Alejandro Ríos:
From Higher-Order to First-Order Rewriting. RTA 2001: 47-62 - 2000
- [c2]Eduardo Bonelli, Delia Kesner, Alejandro Ríos:
A de Bruijn Notation for Higher-Order Rewriting. RTA 2000: 62-79
1990 – 1999
- 1999
- [c1]Eduardo Bonelli:
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting. CSL 1999: 204-219
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-04-30 20:14 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:
