The following pages link to Eduardo Bonelli (Q408546):
Displaying 31 items.
- Justification logic as a foundation for certifying mobile computation (Q408548) (← links)
- On abstract normalisation beyond neededness (Q683744) (← links)
- Type soundness for path polymorphism (Q1744425) (← links)
- Normalisation for higher-order calculi with explicit substitutions (Q1770414) (← links)
- Hypothetical logic of proofs (Q2254560) (← links)
- Typed path polymorphism (Q2424892) (← links)
- Perpetuality in a named lambda calculus with explicit substitutions (Q2713353) (← links)
- (Q2723891) (← links)
- (Q2778870) (← links)
- (Q2848666) (← links)
- (Q2851319) (← links)
- The first-order hypothetical logic of proofs (Q3133155) (← links)
- de Bruijn Indices for Metaterms (Q3371148) (← links)
- Relating Higher-order and First-order Rewriting (Q3371149) (← links)
- Justification Logic and History Based Computation (Q3585058) (← links)
- The Logic of Proofs as a Foundation for Certifying Mobile Computation (Q3605521) (← links)
- (Q4417857) (← links)
- (Q4580227) (← links)
- Justification logic and audited computation (Q4612429) (← links)
- Correspondence assertions for process synchronization in concurrent communications (Q4676156) (← links)
- (Q4945226) (← links)
- (Q5111304) (← links)
- (Q5111900) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311159) (← links)
- Theoretical Computer Science (Q5395086) (← links)
- A nonstandard standardization theorem (Q5408457) (← links)
- The Intensional Lambda Calculus (Q5434495) (← links)
- Boxed ambients with communication interfaces (Q5756976) (← links)
- (Q5874189) (← links)
- A strong bisimulation for a classical term calculus (Q6563051) (← links)
- Reductions in higher-order rewriting and their equivalence (Q6610606) (← links)
