2009 |
20 | EE | Eduardo Bonelli,
Federico Feller:
The Logic of Proofs as a Foundation for Certifying Mobile Computation.
LFCS 2009: 76-91 |
2008 |
19 | EE | Francisco Bavera,
Eduardo Bonelli:
Type-based information flow analysis for bytecode languages with variable object field policies.
SAC 2008: 347-351 |
2007 |
18 | EE | Sergei N. Artëmov,
Eduardo Bonelli:
The Intensional Lambda Calculus.
LFCS 2007: 12-25 |
17 | EE | Eduardo Bonelli,
Adriana B. Compagnoni:
Multipoint Session Types for a Distributed Calculus.
TGC 2007: 240-256 |
16 | EE | Pablo Garralda,
Eduardo Bonelli,
Adriana B. Compagnoni,
Mariangiola Dezani-Ciancaglini:
Boxed ambients with communication interfaces.
Mathematical Structures in Computer Science 17(4): 587-645 (2007) |
2006 |
15 | EE | Eduardo Bonelli:
The Linear Logical Abstract Machine.
Electr. Notes Theor. Comput. Sci. 158: 99-121 (2006) |
2005 |
14 | EE | Eduardo Bonelli,
Adriana B. Compagnoni,
Ricardo Medel:
Information Flow Analysis for a Typed Assembly Language with Polymorphic Stacks.
CASSIS 2005: 37-56 |
13 | EE | Ricardo Medel,
Adriana B. Compagnoni,
Eduardo Bonelli:
A Typed Assembly Language for Non-interference.
ICTCS 2005: 360-374 |
12 | EE | Eduardo Bonelli,
Adriana B. Compagnoni,
Elsa L. Gunter:
Typechecking Safe Process Synchronization.
Electr. Notes Theor. Comput. Sci. 138(1): 3-22 (2005) |
11 | EE | Eduardo Bonelli,
Adriana B. Compagnoni,
Elsa L. Gunter:
Correspondence assertions for process synchronization in concurrent communications.
J. Funct. Program. 15(2): 219-247 (2005) |
10 | EE | Eduardo Bonelli,
Delia Kesner,
Alejandro Ríos:
de Bruijn Indices for Metaterms.
J. Log. Comput. 15(6): 855-899 (2005) |
9 | EE | Eduardo Bonelli,
Delia Kesner,
Alejandro Ríos:
Relating Higher-order and First-order Rewriting.
J. Log. Comput. 15(6): 901-947 (2005) |
8 | EE | Eduardo Bonelli:
Normalisation for higher-order calculi with explicit substitutions.
Theor. Comput. Sci. 333(1-2): 91-125 (2005) |
2004 |
7 | EE | Eduardo Bonelli,
Adriana B. Compagnoni,
Mariangiola Dezani-Ciancaglini,
Pablo Garralda:
Boxed Ambients with Communication Interfaces.
MFCS 2004: 119-148 |
6 | EE | Eduardo Bonelli,
Adriana B. Compagnoni,
Elsa L. Gunter:
Correspondence Assertions for Process Synchronization in Concurrent Communications.
Electr. Notes Theor. Comput. Sci. 97: 175-195 (2004) |
2003 |
5 | EE | Eduardo Bonelli:
A Normalisation Result for Higher-Order Calculi with Explicit Substitutions.
FoSSaCS 2003: 153-168 |
2001 |
4 | EE | Eduardo Bonelli,
Delia Kesner,
Alejandro Ríos:
From Higher-Order to First-Order Rewriting.
RTA 2001: 47-62 |
3 | | Eduardo Bonelli:
Perpetuality in a named lambda calculus with explicit substitutions.
Mathematical Structures in Computer Science 11(1): 47-90 (2001) |
2000 |
2 | | Eduardo Bonelli,
Delia Kesner,
Alejandro Ríos:
A de Bruijn Notation for Higher-Order Rewriting.
RTA 2000: 62-79 |
1999 |
1 | | Eduardo Bonelli:
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting.
CSL 1999: 204-219 |