Search the dblp DataBase
Eduardo Bonelli: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Eduardo Bonelli, Adriana B. Compagnoni, Ricardo Medel
Information Flow Analysis for a Typed Assembly Language with Polymorphic Stacks. [Citation Graph (0, 0)][DBLP]
CASSIS, 2005, pp:37-56 [Conf] - Eduardo Bonelli
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting. [Citation Graph (0, 0)][DBLP]
CSL, 1999, pp:204-219 [Conf] - Eduardo Bonelli
A Normalisation Result for Higher-Order Calculi with Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
FoSSaCS, 2003, pp:153-168 [Conf] - Ricardo Medel, Adriana B. Compagnoni, Eduardo Bonelli
A Typed Assembly Language for Non-interference. [Citation Graph (0, 0)][DBLP]
ICTCS, 2005, pp:360-374 [Conf] - Eduardo Bonelli, Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini, Pablo Garralda
Boxed Ambients with Communication Interfaces. [Citation Graph (0, 0)][DBLP]
MFCS, 2004, pp:119-148 [Conf] - Eduardo Bonelli, Delia Kesner, Alejandro Ríos
A de Bruijn Notation for Higher-Order Rewriting. [Citation Graph (0, 0)][DBLP]
RTA, 2000, pp:62-79 [Conf] - Eduardo Bonelli, Delia Kesner, Alejandro Ríos
From Higher-Order to First-Order Rewriting. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:47-62 [Conf] - Eduardo Bonelli
The Linear Logical Abstract Machine. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2006, v:158, n:, pp:99-121 [Journal] - Eduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter
Correspondence Assertions for Process Synchronization in Concurrent Communications. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2004, v:97, n:, pp:175-195 [Journal] - Eduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter
Typechecking Safe Process Synchronization. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2005, v:138, n:1, pp:3-22 [Journal] - Eduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter
Correspondence assertions for process synchronization in concurrent communications. [Citation Graph (0, 0)][DBLP]
J. Funct. Program., 2005, v:15, n:2, pp:219-247 [Journal] - Eduardo Bonelli, Delia Kesner, Alejandro Ríos
de Bruijn Indices for Metaterms. [Citation Graph (0, 0)][DBLP]
J. Log. Comput., 2005, v:15, n:6, pp:855-899 [Journal] - Eduardo Bonelli, Delia Kesner, Alejandro Ríos
Relating Higher-order and First-order Rewriting. [Citation Graph (0, 0)][DBLP]
J. Log. Comput., 2005, v:15, n:6, pp:901-947 [Journal] - Eduardo Bonelli
Perpetuality in a named lambda calculus with explicit substitutions. [Citation Graph (0, 0)][DBLP]
Mathematical Structures in Computer Science, 2001, v:11, n:1, pp:47-90 [Journal] - Eduardo Bonelli
Normalisation for higher-order calculi with explicit substitutions. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:333, n:1-2, pp:91-125 [Journal] - Sergei N. Artëmov, Eduardo Bonelli
The Intensional Lambda Calculus. [Citation Graph (0, 0)][DBLP]
LFCS, 2007, pp:12-25 [Conf]
Justification Logic and History Based Computation. [Citation Graph (, )][DBLP]
The Logic of Proofs as a Foundation for Certifying Mobile Computation. [Citation Graph (, )][DBLP]
Type-based information flow analysis for bytecode languages with variable object field policies. [Citation Graph (, )][DBLP]
Multipoint Session Types for a Distributed Calculus. [Citation Graph (, )][DBLP]
Superdevelopments for Weak Reduction [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002