Papers

Home Page | Curriculum | Papers | Teaching

Papers

Journal papers
- F. Alessi, F. Barbanera.
  Towards a Semantics for the Quest Language.
  Theoretical Informatics and Applications, vol 28, n. 6, 513-555, 1994.
- F. Alessi, P. Baldan, G. Bellè.
  A Fixed Point Theorem in a Category of Compact Metric Space.
  Theoretical Computer Science, vol. 146, 311-320, 1995.
- F. Alessi, M. Dezani-Ciancaglini, U. de' Liguoro.
  A Convex Powerdomain over Lattices: its Logic and Lambda-Calculus.
  Fundamentae Informaticae vol. 32, 193-250, 1997.
- F. Alessi, P. Baldan.
  A Characterization of Distance between 1-Bounded Compact Ultrametric Spaces through a Universal Space.
  Theoretical Computer Science, vol. 193, 113-127, 1998.
- F. Alessi, P. Baldan, F. Honsell.
  A category of compositional domain-models for separable Stone spaces.
  Theoretical Computer Science, 290(1), 599-635, 2003. Elsevier Science.
- M. Dezani-Ciancaglini, F. Honsell, F. Alessi.
  A complete characterization of complete intersection-type preorders.
  ACM TOCL 4(1), 120-147, 2003.
- F. Alessi, M. Dezani-Ciancaglini, S. Lusin.
  Intersection types and domains operators.
  Theoretical Computer Science 316 , 25-47, 2004.
- F. Alessi, F. Barbanera, M. Dezani-Ciancaglini.
  Intersection types and lambda models.
  Theoretical Computer Science, 355(2), 108-126, 2006.
- F. Alessi.
  An irregular filter model.
  Theoretical Computer Science 398, 129--149, 2008.
International Conferences/Workshops
- F. Alessi, F. Barbanera.
  Strong Conjunction and Intersection Types.
  Mathematical Foundations of Computer Science 1991 Springer LNCS 520, Springer-Verlag, Berlin, 64-73, 1991.
- F. Alessi, F. Barbanera.
  Toward a Semantics for The Quest Language (Extended Abstract).
  Sixth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 12-21, 1991.
- F. Alessi.
  Type Preorders.
  Trees in Algebra and Programming-CAAP'94. Springer LNCS 787, 37-51, 1994.
- F. Alessi, M. Dezani Ciancaglini, U. de' Liguoro.
  May and Must Convergency in Concurrent Lambda-Calculus.
  Mathematical Foundations of Computer Science 1994, Springer LNCS 841, 211-220, 1994.
- F. Alessi, P Baldan, G. Bellè, J.J.M.M. Rutten.
  Solutions of Functorial and Non-Functorial Metric Domain Equations.
  Mathematical Foundations of Programming Semantics, Eleventh Conference, 1995. Electronic Notes in Theoretical Computer Science 1, 1995.
- F. Alessi, P Baldan, G. Bellè, J.J.M.M. Rutten.
  Solutions of Functorial and Non-Functorial Metric Domain Equations (Abstract).
  Theoretical Computer Science, 152 n. 2, p. 324 (1995).
- F. Alessi, P. Baldan, F. Honsell.
  Partializing Stone Spaces Using SFP Domains. (Extended Abstract).
  CAAP'97 Conference Proceedings, M. Bidoit and M. Dauchet eds., Springer LNCS 1214, 478-489 (1997).
- M. Dezani-Ciancaglini, F. Honsell, F. Alessi.
  A complete characterization of complete intersection-type theories.
  In J. Rolim, A. Broder, A. Corradini, R. Gorrieri, R. Heckel, J. Hrmomkovic, U. Vaccaro, and J. Wells, editors, ITRS'00 Workshop, Proceedings in Informatics 8, pages 287-302, Carleton Scientifics, 2000.
- F. Alessi, M. Dezani-Ciancaglini, F. Honsell.
  Filter models and easy terms.
  ICTCS'01, Seventh Italian Conference on Theoretical Computer Science, LNCS 2002, pages 17-37. Springer, 2001.
- F. Alessi, S. Lusin.
  Simple easy terms.
  ITRS '02, Second Workshop in Intersection Types and Related Systems. Ed. S. van Bakkel Electronic Notes in Theoretical Computer Science, volume 70.1. Elsevier.
- F. Alessi, F. Barbanera, M. Dezani-Ciancaglini.
  Intersection Types and computational rules.
  Proceedings of Wollic 2003. Electronic Notes in Computer Science, volume 84. Elsevier.
- F. Alessi, F. Barbanera, M. Dezani-Ciancaglini.
  Tailoring Filter Models.
  Third International Workshop TYPES '03, Torino, Italy (eds. S. Berardi, M. Coppo, F. Damiani). Lecture Notes in Computer Science, Volume 3085, 2004, pp. 17-33.
- F. Alessi, M. Dezani-Ciancaglini, F. Honsell.
  Inverse limit models as filter models.
  HOR '04, 2nd International Workshop on Higher-Order Rewriting (Delia Kesner, Femke van Raamsdonk, Joe Wells eds.), RWTH Aachen publisher, 2004, pp 3-25.
- F. Alessi, M. Dezani-Ciancaglini.
  Type preorders and recursive terms.
  ITRS '04 (M. Coppo and F. Damiani eds.), Electronic Lecture Notes in Theoretical Computer Science, Elsevier, Volume 136, 2005, pp. 3-21.
- F. Alessi, P. Severi.
  Recursive Domain Equations of Filter Models.
  SOFSEM '08, Lecture Notes in Computer Science 4910, 2008, pp. 124-135.
Research reports
- F. Alessi.
  The category p-SFP.
  Rapporto di ricerca UDMI/27/96/RR, Università di Udine.
- F. Alessi, P. Baldan, F. Honsell.
  Partializing Stone Spaces Using SFP Domains.
  Rapporto di ricerca UDMI/05/97/RR, Dipartimento di Matematica e Informatica dell'Università di Udine, 1997.
- F. Alessi, F. Barbanera, M. Dezani-Ciancaglini.
  Tailoring filter models.
  Rapporto di ricerca UDMI/05/2004/RR, Università di Udine.
- F. Alessi, F. Barbanera, M. Dezani-Ciancaglini.
  Intersection types and lambda models.
  Rapporto di ricerca UDMI/06/2004/RR, Università di Udine. Sottomesso per pubblicazione su Theoretical Computer Science.
- F. Alessi, M. Dezani-Ciancaglini, S. Lusin.
  Intersection types and domain operators.
  Rapporto di ricerca UDMI/07/2004/RR, Università di Udine.
- F. Alessi, M. Dezani-Ciancaglini, F. Honsell.
  Inverse limit models as filter models.
  Rapporto di ricerca UDMI/10/2004/RR, Università di Udine.
- F. Alessi, M. Dezani-Ciancaglini.
  Type preorders and recursive terms.
  Rapporto di ricerca UDMI/11/2004/RR, Università di Udine.
“Meglio praticare che pubblicare la propria saggezza”
(adattamento, fonte anonima)

Home Page