Eduardo Bonelli

According to our database1, Eduardo Bonelli authored at least 41 papers between 1999 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A Strong Bisimulation for Control Operators by Means of Multiplicative and Exponential Reduction.
CoRR, 2021

2020
Rewrites as Terms through Justification Logic.
Proceedings of the PPDP '20: 22nd International Symposium on Principles and Practice of Declarative Programming, 2020

Strong Bisimulation for Control Operators (Invited Talk).
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019
Typed path polymorphism.
Theor. Comput. Sci., 2019

Strong Bisimulation for Control Operators.
CoRR, 2019

2018
Justification logic and audited computation.
J. Log. Comput., 2018

Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need: Extended Abstract.
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

2017
On abstract normalisation beyond neededness.
Theor. Comput. Sci., 2017

Foundations of strong call by need.
Proc. ACM Program. Lang., 2017

The first-order hypothetical logic of proofs.
J. Log. Comput., 2017

Optimality and the Linear Substitution Calculus.
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

2015
Type Soundness for Path Polymorphism.
Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, 2015

Efficient Type Checking for Path Polymorphism.
Proceedings of the 21st International Conference on Types for Proofs and Programs, 2015

2014
Hypothetical Logic of Proofs.
Logica Universalis, 2014

Intuitionistic Hypothetical Logic of Proofs.
Electron. Notes Theor. Comput. Sci., 2014

An abstract normalisation result with applications to non-sequential calculi.
CoRR, 2014

A nonstandard standardization theorem.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013
BioScape: A Modeling and Simulation Language for Bacteria-Materials Interactions.
Electron. Notes Theor. Comput. Sci., 2013

2012
Justification Logic as a foundation for certifying mobile computation.
Ann. Pure Appl. Log., 2012

Normalisation for Dynamic Pattern Calculi.
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

2011
On-the-Fly Inlining of Dynamic Dependency Monitors for Secure Information Flow.
Proceedings of the Formal Aspects of Security and Trust - 8th International Workshop, 2011

2010
Justification Logic and History Based Computation.
Proceedings of the Theoretical Aspects of Computing, 2010

2009
Superdevelopments for Weak Reduction
Proceedings of the Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming, 2009

The Logic of Proofs as a Foundation for Certifying Mobile Computation.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

2008
Type-based information flow analysis for bytecode languages with variable object field policies.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

2007
Boxed ambients with communication interfaces.
Math. Struct. Comput. Sci., 2007

Multipoint Session Types for a Distributed Calculus.
Proceedings of the Trustworthy Global Computing, Third Symposium, 2007

The Intensional Lambda Calculus.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

2006
The Linear Logical Abstract Machine.
Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics, 2006

2005
Normalisation for higher-order calculi with explicit substitutions.
Theor. Comput. Sci., 2005

Relating Higher-order and First-order Rewriting.
J. Log. Comput., 2005

de Bruijn Indices for Metaterms.
J. Log. Comput., 2005

Typechecking Safe Process Synchronization.
Electron. Notes Theor. Comput. Sci., 2005

A Typed Assembly Language for Non-interference.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

Information Flow Analysis for a Typed Assembly Language with Polymorphic Stacks.
Proceedings of the Construction and Analysis of Safe, 2005

2004
Correspondence Assertions for Process Synchronization in Concurrent Communications.
Electron. Notes Theor. Comput. Sci., 2004

2003
A Normalisation Result for Higher-Order Calculi with Explicit Substitutions.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

2001
Perpetuality in a named lambda calculus with explicit substitutions.
Math. Struct. Comput. Sci., 2001

From Higher-Order to First-Order Rewriting.
Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

2000
A de Bruijn Notation for Higher-Order Rewriting.
Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000

1999
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999


  Loading...