Eduardo Bonelli

Log. Methods Comput. Sci., 2024

2023

Reductions in Higher-Order Rewriting and Their Equivalence.

[BibT_eX]

[DOI]

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2021

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

[BibT_eX]

[DOI]

CoRR, 2021

2020

Rewrites as Terms through Justification Logic.

[BibT_eX]

[DOI]

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

Strong Bisimulation for Control Operators (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019

Typed path polymorphism.

[BibT_eX]

[DOI]

Mauricio Ayala-Rincón

Juan Edi

Theor. Comput. Sci., 2019

Strong Bisimulation for Control Operators.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Justification logic and audited computation.

[BibT_eX]

[DOI]

Francisco Bavera

J. Log. Comput., 2018

Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need: Extended Abstract.

[BibT_eX]

[DOI]

Kareem Mohamed

Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

2017

On abstract normalisation beyond neededness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Foundations of strong call by need.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2017

The first-order hypothetical logic of proofs.

[BibT_eX]

[DOI]

Gabriela Steren

J. Log. Comput., 2017

Optimality and the Linear Substitution Calculus.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

2015

Type Soundness for Path Polymorphism.

[BibT_eX]

[DOI]

Mauricio Ayala-Rincón

Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, 2015

Efficient Type Checking for Path Polymorphism.

[BibT_eX]

[DOI]

Juan Edi

Proceedings of the 21st International Conference on Types for Proofs and Programs, 2015

2014

Hypothetical Logic of Proofs.

[BibT_eX]

[DOI]

Gabriela Steren

Logica Universalis, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

A nonstandard standardization theorem.

[BibT_eX]

[DOI]

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

2013

Intuitionistic Hypothetical Logic of Proofs.

[BibT_eX]

[DOI]

Gabriela Steren

Proceedings of the 6th Workshop on Intuitionistic Modal Logic and Applications, 2013

2012

BioScape: A Modeling and Simulation Language for Bacteria-Materials Interactions.

[BibT_eX]

[DOI]

Proceedings of the Third International Workshop on Interactions Between Computer Science and Biology, 2012

Justification Logic as a foundation for certifying mobile computation.

[BibT_eX]

[DOI]

Federico Feller

Ann. Pure Appl. Log., 2012

Normalisation for Dynamic Pattern Calculi.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Luciano Bello

Proceedings of the Formal Aspects of Security and Trust - 8th International Workshop, 2011

2010

Justification Logic and History Based Computation.

[BibT_eX]

[DOI]

Francisco Bavera

Proceedings of the Theoretical Aspects of Computing, 2010

2009

Superdevelopments for Weak Reduction

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Federico Feller

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.

[BibT_eX]

[DOI]

Francisco Bavera

Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

2007

Boxed ambients with communication interfaces.

[BibT_eX]

[DOI]

Pablo Garralda

Mariangiola Dezani-Ciancaglini

Math. Struct. Comput. Sci., 2007

Multipoint Session Types for a Distributed Calculus.

[BibT_eX]

[DOI]

Proceedings of the Trustworthy Global Computing, Third Symposium, 2007

The Intensional Lambda Calculus.

[BibT_eX]

[DOI]

Sergei N. Artëmov

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

2006

The Linear Logical Abstract Machine.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics, 2006

2005

Normalisation for higher-order calculi with explicit substitutions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Relating Higher-order and First-order Rewriting.

[BibT_eX]

[DOI]

J. Log. Comput., 2005

de Bruijn Indices for Metaterms.

[BibT_eX]

[DOI]

J. Log. Comput., 2005

Correspondence assertions for process synchronization in concurrent communications.

[BibT_eX]

[DOI]

Elsa L. Gunter

J. Funct. Program., 2005

A Typed Assembly Language for Non-interference.

[BibT_eX]

[DOI]

Ricardo H. Medel

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

Information Flow Analysis for a Typed Assembly Language with Polymorphic Stacks.

[BibT_eX]

[DOI]

Ricardo H. Medel

Proceedings of the Construction and Analysis of Safe, 2005

2004

Typechecking Safe Process Synchronization.

[BibT_eX]

[DOI]

Elsa L. Gunter

Proceedings of the Workshop 3rd on the Foundations of Global Ubiquitous Computing, 2004

2003

A Normalisation Result for Higher-Order Calculi with Explicit Substitutions.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2003

2001

Perpetuality in a named lambda calculus with explicit substitutions.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2001

From Higher-Order to First-Order Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

2000

A de Bruijn Notation for Higher-Order Rewriting.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]