Eduardo Bonelli

55 papers A* 1B 8C 3Misc 3Journal 23Unranked 14

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Classical Linear λ-Calculus based on Contraposition. CoRR Pablo Barenbaum, Eduardo Bonelli, Leopoldo Lerena
2025	J	`jnl`	Preface to Special Issue dedicated to LSFA 2021 and LSFA 2022. Math. Struct. Comput. Sci. Eduardo Bonelli, Daniele Nantes-Sobrinho
2025	J	`jnl`	Sharing and Linear Logic with Restricted Access (Extended Version). CoRR Pablo Barenbaum, Eduardo Bonelli
2025	B	`conf`	Sharing and Linear Logic with Restricted Access. FoSSaCS Pablo Barenbaum, Eduardo Bonelli
2024	J	`jnl`	A Strong Bisimulation for a Classical Term Calculus. Log. Methods Comput. Sci. Eduardo Bonelli, Delia Kesner, Andrés Viso
2023	B	`conf`	Reductions in Higher-Order Rewriting and Their Equivalence. CSL Pablo Barenbaum, Eduardo Bonelli
2022	—	`ed.`	Proceedings 16th Logical and Semantic Frameworks with Applications, LSFA 2021, Buenos Aires, Argentina (Online), 23rd - 24th July, 2021. LSFA Mauricio Ayala-Rincón, Eduardo Bonelli
2022	J	`jnl`	Reductions in Higher-Order Rewriting and Their Equivalence. CoRR Pablo Barenbaum, Eduardo Bonelli
2021	J	`jnl`	A Strong Bisimulation for Control Operators by Means of Multiplicative and Exponential Reduction. CoRR Eduardo Bonelli, Delia Kesner, Andrés Viso
2020	C	`conf`	Rewrites as Terms through Justification Logic. PPDP Pablo Barenbaum, Eduardo Bonelli
2020	B	`conf`	Strong Bisimulation for Control Operators (Invited Talk). CSL Delia Kesner, Eduardo Bonelli, Andrés Viso
2019	J	`jnl`	Strong Bisimulation for Control Operators. CoRR Eduardo Bonelli, Delia Kesner, Andrés Viso
2019	J	`jnl`	Typed path polymorphism. Theor. Comput. Sci. Mauricio Ayala-Rincón, Eduardo Bonelli, Juan Edi, Andrés Viso
2018	J	`jnl`	Justification logic and audited computation. J. Log. Comput. Francisco Bavera, Eduardo Bonelli
2018	C	`conf`	Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need: Extended Abstract. PPDP Pablo Barenbaum, Eduardo Bonelli, Kareem Mohamed
2017	J	`jnl`	Efficient Type Checking for Path Polymorphism. CoRR Juan Edi, Andrés Viso, Eduardo Bonelli
2017	J	`jnl`	Foundations of strong call by need. Proc. ACM Program. Lang. Thibaut Balabonski, Pablo Barenbaum, Eduardo Bonelli, Delia Kesner
2017	J	`jnl`	On abstract normalisation beyond neededness. Theor. Comput. Sci. Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos
2017	B	`conf`	Optimality and the Linear Substitution Calculus. FSCD Pablo Barenbaum, Eduardo Bonelli
2017	J	`jnl`	The first-order hypothetical logic of proofs. J. Log. Comput. Gabriela Steren, Eduardo Bonelli
2016	J	`jnl`	Type Soundness for Path Polymorphism. CoRR Andrés Viso, Eduardo Bonelli, Mauricio Ayala-Rincón
2015	—	`conf`	Efficient Type Checking for Path Polymorphism. TYPES Juan Edi, Andrés Viso, Eduardo Bonelli
2015	—	`conf`	Type Soundness for Path Polymorphism. LSFA Andrés Viso, Eduardo Bonelli, Mauricio Ayala-Rincón
2014	A*	`conf`	A nonstandard standardization theorem. POPL Beniamino Accattoli, Eduardo Bonelli, Delia Kesner, Carlos Lombardi
2014	J	`jnl`	An abstract normalisation result with applications to non-sequential calculi. CoRR Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos
2014	J	`jnl`	Hypothetical Logic of Proofs. Logica Universalis Eduardo Bonelli, Gabriela Steren
2014	—	`ed.`	Proceedings 9th International Workshop on Developments in Computational Models, DCM 2013, Buenos Aires, Argentina, 26 August 2013. DCM Mauricio Ayala-Rincón, Eduardo Bonelli, Ian Mackie
2013	—	`conf`	Intuitionistic Hypothetical Logic of Proofs. IMLA@UNILOG Gabriela Steren, Eduardo Bonelli
2012	—	`conf`	BioScape: A Modeling and Simulation Language for Bacteria-Materials Interactions. CS2Bio Adriana B. Compagnoni, Vishakha Sharma, Yifei Bao, Matthew Libera, Svetlana Sukhishvili, Philippe Bidinger, Livio Bioglio, Eduardo Bonelli
2012	J	`jnl`	Justification Logic as a foundation for certifying mobile computation. Ann. Pure Appl. Log. Eduardo Bonelli, Federico Feller
2012	—	`conf`	Normalisation for Dynamic Pattern Calculi. RTA Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos
2011	—	`conf`	On-the-Fly Inlining of Dynamic Dependency Monitors for Secure Information Flow. Formal Aspects in Security and Trust Luciano Bello, Eduardo Bonelli
2010	C	`conf`	Justification Logic and History Based Computation. ICTAC Francisco Bavera, Eduardo Bonelli
2010	—	`ed.`	Proceedings 5th International Workshop on Higher-Order Rewriting, HOR 2010, Edinburgh, UK, July 14, 2010. HOR Eduardo Bonelli
2009	—	`conf`	Superdevelopments for Weak Reduction WRS Eduardo Bonelli, Pablo Barenbaum
2009	Misc	`conf`	The Logic of Proofs as a Foundation for Certifying Mobile Computation. LFCS Eduardo Bonelli, Federico Feller
2008	Misc	`conf`	Type-based information flow analysis for bytecode languages with variable object field policies. SAC Francisco Bavera, Eduardo Bonelli
2007	J	`jnl`	Boxed ambients with communication interfaces. Math. Struct. Comput. Sci. Pablo Garralda, Eduardo Bonelli, Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini
2007	—	`conf`	Multipoint Session Types for a Distributed Calculus. TGC Eduardo Bonelli, Adriana B. Compagnoni
2007	Misc	`conf`	The Intensional Lambda Calculus. LFCS Sergei N. Artëmov, Eduardo Bonelli
2006	B	`conf`	The Linear Logical Abstract Machine. MFPS Eduardo Bonelli
2005	—	`conf`	A Typed Assembly Language for Non-interference. ICTCS Ricardo H. Medel, Adriana B. Compagnoni, Eduardo Bonelli
2005	J	`jnl`	Correspondence assertions for process synchronization in concurrent communications. J. Funct. Program. Eduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter
2005	—	`conf`	Information Flow Analysis for a Typed Assembly Language with Polymorphic Stacks. CASSIS Eduardo Bonelli, Adriana B. Compagnoni, Ricardo H. Medel
2005	J	`jnl`	Normalisation for higher-order calculi with explicit substitutions. Theor. Comput. Sci. Eduardo Bonelli
2005	J	`jnl`	Relating Higher-order and First-order Rewriting. J. Log. Comput. Eduardo Bonelli, Delia Kesner, Alejandro Ríos
2005	J	`jnl`	de Bruijn Indices for Metaterms. J. Log. Comput. Eduardo Bonelli, Delia Kesner, Alejandro Ríos
2004	B	`conf`	Boxed Ambients with Communication Interfaces. MFCS Eduardo Bonelli, Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini, Pablo Garralda
2004	—	`conf`	Typechecking Safe Process Synchronization. FGUC Eduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter
2003	B	`conf`	A Normalisation Result for Higher-Order Calculi with Explicit Substitutions. FoSSaCS Eduardo Bonelli
2003	—	`conf`	Correspondence Assertions for Process Synchronization in Concurrent Communications. FOCLASA Eduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter
2001	—	`conf`	From Higher-Order to First-Order Rewriting. RTA Eduardo Bonelli, Delia Kesner, Alejandro Ríos
2001	J	`jnl`	Perpetuality in a named lambda calculus with explicit substitutions. Math. Struct. Comput. Sci. Eduardo Bonelli
2000	—	`conf`	A de Bruijn Notation for Higher-Order Rewriting. RTA Eduardo Bonelli, Delia Kesner, Alejandro Ríos
1999	B	`conf`	Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting. CSL Eduardo Bonelli