Publications (ProToCoLLo)                  BackToHomePage

[1]

Fabio Alessi, Franco Barbanera, and Mariangiola Dezani-Ciancaglini. Intersection types and computational rules. In Ruy de Queiroz, Elaine Pimentel, and Lucilia Figueiredo, editors, WoLLIC'03, number 84 in El. Notes in Theoret. Comput. Sci. Elsevier, 2003.

[2]

J.M. Andreoli, R. Maieli, and P. Ruet. Constraint-based proof construction in non commutative logic. Theoretical Computer Science, 2004. To appear.

[3]

P. Baillot and M. Pedicini. An embedding of Blum-Shub-Smale model of computation in LLL. in preparation.

[4]

Patrick Baillot and Marco Pedicini. Elementary complexity and geometry of interaction. Fund. Inform., 45(1-2):1-31, 2001. Typed lambda calculi and applications (L'Aquila, 1999).

[5]

P. Ballario and M. Pedicini. Quantitative operational semantics in formal molecular biology. in preparation.

[6]

S. Baratella and A. Masini. A proof-theoretic investigation of a logic of positions. Annals of Pure and Applied Logic, 123:135-162, 2003.

[7]

S. Baratella and A. Masini. An approach to infinitary temporal proof theory. Archive for Mathematical Logic, 2004.

[8]

S. Baratella and A. Masini. An infinitary variant of metric temporal logic over dense time domains. Mathematical Logic Quarterly, 50:249-257, 2004.

[9]

S. Baratella and A. Masini. A way of making intensional quantification explicit. Logic Journal of the IGPL, 2004.

[10]

Franco Barbanera and Ugo de' Liguoro. Type assignement for mobile objects. Electronic Notes in Theoretical Computer Science, 2003.

[11]

Paolo Coppola and Simona Ronchi Della Rocca. Principal typing for elementary affine logic. In Hofmann M., editor, Typed Lambda Calculi and Applications: 6th International Conference (TLCA 2003), volume 2701 of Lecture Notes in Computer Science, pages 90-104, Berlin, 2003. Springer-Verlag. A preliminary version has been presented at the workshop ``LL-Linear Logic'', affiliated to FLoC'02, Copenhagen.

[12]

Ugo Dal Lago. On the expressive power of light affine logic. In Carlo Blundo and Cosimo Laneve, editors, Eight Italian Conference on Theoretical Computer Science, Proceedings, volume 2841 of Lecture Notes in Computer Science, pages 216-227. Springer, 2003.

[13]

Ugo Dal Lago and Simone Martini. Phase semantics and decidability of elementary affine logic. Theoretical Computer Science, 2004. To appear.

[14]

Ugo Dal Lago, Simone Martini, and Luca Roversi. Higher order linear ramified recurrence. In Types Conference, Post-Workshop Proceedings, Lecture Notes in Computer Science. Springer, 2004. To appear.

[15]

Mariangiola Dezani-Ciancaglini, Silvia Ghilezan, and Silvia Likavec. Behavioural inverse limit lambda-models. Electronic Notes in Theoretical Computer Science, 2004. To appear.

Keywords: Lambda calculus, intersection types, models of lambda calculus, Stone dualities, reducibility method

[16]

Mariangiola Dezani-Ciancaglini, Furio Honsell, and Fabio Alessi. A complete characterization of complete intersection-type preorders. ACM Transactions on Computational Logic, 4(1):120-147, 2003.

[17]

F.Honsell and M. Lenisa. Wave-style geometry of interaction models in rel are graph-like lambda models. In Proceedings of TYPES'03, Lecture Notes in Computer Science. Springer Verlag, 2003.

[18]

F.Honsell, M. Lenisa, and R. Redamalla. Strict geometry of interaction graph models. In Proceedings of LPAR'03, volume 2850 of Lecture Notes in Artificial Intelligence, pages 403-417. Springer Verlag, 2003.

[19]

Stefano Guerrini, Simone Martini, and Andrea Masini. Coherence for sharing proof-nets. Theoretical Computer Science, 294:379-409, 2003.

[20]

Jean-Baptiste Joinet, Harold Schellinx, and Lorenzo Tortora de Falco. SN and CR for free-style LK^tq: linear decorations and simulation of normalization. Journal of Symbolic Logic, 67 (1):162-196, 2002.

[21]

Olivier Laurent, Myriam Quatrini, and Lorenzo Tortora de Falco. Polarized and focalized linear and classical proofs. Annals of Pure and Applied Logic, 2000. to appear.

[22]

Olivier Laurent and Lorenzo Tortora de Falco. Slicing polarized additive normalization. Quaderno 12, Istituto per le Applicazioni del Calcolo, Roma, Italy, June 2001. To appear in Linear Logic in Computer Science, Thomas Ehrhard, Jean-Yves Girard, Paul Ruet and Phil Scott editors, London Mathematical Society Lecture Notes Series, Cambridge University Press.

[23]

P. Loreti and M. Pedicini. Idempotent analogue of resolvent kernels for a deterministic optimal control problem. Mat. Zametki, 69(2):235-244, 2001.

[24]

P. Loreti and M. Pedicini. An object oriented approach to idempotent analysis: Integral equations as optimal control problems. In Proceedings of the International Workshop on Idempotent Mathematics nnd Mathematical Physics, International Erwin Schroedinger Institute (2003), AMS, Contemporary Mathematics. AMS, 2004.

[25]

Roberto Maieli and Quintijn Puite. Modularity of proof-nets: generating the type of a module. Archive for Mathematical Logic, to appear, 2004.

[26]

Damiano Mazza. Logica lineare e complessità computazionale. Tesi di laurea, Università degli Studi Roma Tre, Rome, 2002.

[27]

Damiano Mazza. Notes on light linear logic. Technical report, Institut de Mathématiques de Luminy, 2003.

[28]

Luca Paolini. Lambda-theories: some investigations. PhD thesis, Università di Genova and Université de la Méditerranée, 2003.

[29]

Luca Paolini and Simona Ronchi Della Rocca. Lazy logical semantics. Electronic Notes in Theoretical Computer Science, 2003.

[30]

Luca Paolini and Simona Ronchi Della Rocca. Parametric parameter passing lambda-calculus. Information and Computation, 189(1):87-106, 2004.

[31]

M. Pedicini and F. Quaglia. PELCR: Parallel Environment for optimal Lambda Calculus Reduction. in preparation.

[32]

M. Pedicini and F. Quaglia. A parallel implementation for optimal lambda-calculus reduction. In 2nd International Conference on Principles and Practice of Declarative Programming (PPDP 2000, Montreal), ACM Proceedings, pages 3-14. ACM Press, Berlin, 2000.

[33]

M. Pedicini and F. Quaglia. Scheduling vs. communication in PELCR. In Euro-Par'2002 - Parallel Processing, (Paderborn 2002), volume 2400 of Lecture Notes in Comput. Sci., pages 648-654. Springer, Berlin, 2002.

[34]

Marco Pedicini. Greedy expansions and sets with deleted digits.

[35]

Marco Pedicini and Quintijn Puite. On the number of provable formulas. in preparation, 2002.

[36]

Elaine Pimentel, Simona Ronchi della Rocca, and Luca Roversi. Towards a proof-theoretical justification for intersection types. Technical report, Dipartimento di Informatica, Università di Torino, 2004.

[37]

Myriam Quatrini and Lorenzo Tortora de Falco. Polarisation des preuves classiques et renversement. Compte-Rendu de l'Académie des Sciences de Paris, 323:113-116, 1996.

[38]

Simona Ronchi Della Rocca. Typed Intersection Lambda Calculus. In LTRS 2002, volume 70(1) of Electronic Notes in Computer Science. Elsevier, 2002.

[39]

Simona Ronchi Della Rocca and Luca Paolini. The parametric lambda-calculus: a metamodel for computation. Computer Science - Monograph. Springer-Verlag, 2004. Ed. Ingeborg Mayer.

[40]

Simona Ronchi Della Rocca and Luca Roversi. Intersection Logic. In Proceedings of CSL'01, volume 2412 of Lecture Notes in Computer Science, pages 414 - 428. Springer Verlag, 2001.

[41]

Ugo Solitro. An interaction calculus for concurrent systems. Technical Report RR 15/2004, Dipartimento di Informatica - Universita' degli Studi di Verona, Strada Le Grazie, 15 - I-37134 Verona (Italy), 2004.

Keywords: Concurrency, lambda calculus, interaction, linear logic

[42]

Lorenzo Tortora de Falco. Denotational semantics for polarized (but non-constrained) LK by means of the additives. In 5^th Kurt Goedel Colloquium KGC'97, computational logic and proof theory, volume 1289 of Lecture Notes in Computer Science, pages 290-304, 1997.

[43]

Lorenzo Tortora de Falco. The additive multiboxes. Annals of Pure and Applied Logic, 120, Issue 1-3:65-102, 2003.

[44]

Lorenzo Tortora de Falco. Additives of linear logic and normalization- part I: a (restricted) church-rosser property. Theoretical Computer Science, 294/3:489-524, 2003.

[45]

Lorenzo Tortora de Falco. Obsessional experiments for linear logic proof-nets. Mathematical Structures in Computer Science, 13, Issue 1:799-855, 2003.