|
|
Some recent talks
- Invariant cost models
for rewrite-based languages.
Invited talk at Linearity 2009, Coimbra, September 2009.
- On Constructor Rewrite Systems and the Lambda-Calculus.
Presented at ICALP 2009, Rhodes, July 2009.
See also the companion paper,
with
U. Dal Lago. May 2009. Shorter version in Springer LNCS 5556, pp. 163-174, July 2009.
- How much does it cost to normalize a proof?.
Presented at Logique et Interaction:
vers une Géométrie de la Cognition, dicembre 2007, Albano.
- Informatica: Elogio di Babele.
Presented at Didamatica 2007, maggio 2007, Cesena.
See also the companion paper.
Mondo Digitale, no. 2 - giugno 2008, 17-23.
- Proofs as efficient programs.
Presented at Deduction, Computation, Experiment:
Exploring the effectiveness of proof, workshop organized by the Dpt. of Philosophy, Bologna.
See also the companion paper,
with
U. Dal Lago. January 2008. In Deduction, Computation, Experiment,
R. Lupacchini, G. Corsi (Eds.), Springer-Verlag, 2008.
- Implicit computational complexity: a micro-survey.
Presented at a meeting of project FOLLIA, Torino, January 2006.
- Tailoring Gödel's T to complexity classes.
Presented at AILA 2005, XXII Incontro di Logica Matematica
Pisa, February 2005.
|
