5 citations · 12 across the 9 of their papers we have counts for
10 papers
Reductions in Higher-Order Rewriting and Their Equivalence
Pablo Barenbaum, Eduardo Bonelli
Proof terms are syntactic expressions that represent computations in term rewriting. They were introduced by Meseguer and exploited by van Oostrom and de Vrijer to study equivalenc…
Proceedings 16th Logical and Semantic Frameworks with Applications
Mauricio Ayala-Rincon, Eduardo Bonelli
This volume contains the post-proceedings of the Sixteenth Logical and Semantic Frameworks with Applications (LSFA 2021). The meeting was held online on July 23-24, 2021, organised…
A Strong Bisimulation for a Classical Term Calculus
Eduardo Bonelli, Delia Kesner, Andrés Viso
When translating a term calculus into a graphical formalism many inessential details are abstracted away. In the case of -calculus translated to proof-nets, these inessential de…
Strong Bisimulation for Control Operators
Eduardo Bonelli, Delia Kesner, Andrés Viso
The purpose of this paper is to identify programs with control operators whose reduction semantics are in exact correspondence. This is achieved by introducing a relation ,…
Efficient Type Checking for Path Polymorphism
Juan Edi, Andrés Viso, Eduardo Bonelli
A type system combining type application, constants as types, union types (associative, commutative and idempotent) and recursive types has recently been proposed for statically ty…
Type Soundness for Path Polymorphism
Andrés Viso, Eduardo Bonelli, Mauricio Ayala-Rincón
Path polymorphism is the ability to define functions that can operate uniformly over arbitrary recursively specified data structures. Its essence is captured by patterns of the for…