Towards a Semantics for the QUEST Language - Fabio Alessi; Franco Barbanera (LICS, 1991)

Strong Conjunction and Intersection Types. - Fabio Alessi; Franco Barbanera (MFCS, 1991)

Type Preorders. - Fabio Alessi (CAAP, 1994)

May and Must Convergencey in Concurrent Lambda-Calculus. - Fabio Alessi; Mariangiola Dezani-Ciancaglini; Ugo de'Liguoro (MFCS, 1994)

Toward A Semantics for the Quest Language. - Fabio Alessi; Franco Barbanera (RAIRO Theor. Informatics Appl., 1994)

Solutions of functorial and non-functorial metric domain equations. - Fabio Alessi; Paolo Baldan; Gianna Bellè; Jan J. M. M. Rutten (MFPS, 1995)

A Fixed-Point Theorem in a Category of Compact Metric Spaces. - Fabio Alessi; Paolo Baldan; Gianna Bellè (Theor. Comput. Sci., 1995)

Partializing Stone Spaces using SFP Domains (Extended Abstract). - Fabio Alessi; Paolo Baldan; Furio Honsell (TAPSOFT, 1997)

A Convex Powerdomain over Lattices: Its Logic and lambda-Calculus. - Fabio Alessi; Mariangiola Dezani-Ciancaglini; Ugo de'Liguoro (Fundam. Informaticae, 1997)

A Characterization of Distance Between 1-Bounded Compact Ultrametic Spaces Through a Universal Space. - Fabio Alessi; Paolo Baldan (Theor. Comput. Sci., 1998)

A Complete Characterization of the Complete Intersection-Type Theories. - Mariangiola Dezani-Ciancaglini; Furio Honsell; Fabio Alessi (ICALP Satellite Workshops, 2000)

Filter Models and Easy Terms. - Fabio Alessi; Mariangiola Dezani-Ciancaglini; Furio Honsell (ICTCS, 2001)

Simple Easy Terms. - Fabio Alessi; Stefania Lusin (ITRS, 2002)

Tailoring Filter Models. - Fabio Alessi; Franco Barbanera; Mariangiola Dezani-Ciancaglini (TYPES, 2003)

Intersection Types and Computational Rules. - Fabio Alessi; Franco Barbanera; Mariangiola Dezani-Ciancaglini (WoLLIC, 2003)

A category of compositional domain-models for separable Stone spaces. - Fabio Alessi; Paolo Baldan; Furio Honsell (Theor. Comput. Sci., 2003)

A complete characterization of complete intersection-type preorders. - Mariangiola Dezani-Ciancaglini; Furio Honsell; Fabio Alessi (ACM Trans. Comput. Log., 2003)

Type Preorders and Recursive Terms. - Fabio Alessi; Mariangiola Dezani-Ciancaglini (ITRS, 2004)

Intersection types and domain operators. - Fabio Alessi; Mariangiola Dezani-Ciancaglini; Stefania Lusin (Theor. Comput. Sci., 2004)

Intersection types and lambda models. - Fabio Alessi; Franco Barbanera; Mariangiola Dezani-Ciancaglini (Theor. Comput. Sci., 2006)

Recursive Domain Equations of Filter Models. - Fabio Alessi; Paula Severi (SOFSEM, 2008)

An irregularfilter model. - Fabio Alessi (Theor. Comput. Sci., 2008)

Tiered Objects. - Fabio Alessi; Felice Cardone (Fundam. Informaticae, 2016)

A Definitional Implementation of the Lax Logical Framework LLFP in Coq, for Supporting Fast and Loose Reasoning. - Fabio Alessi; Alberto Ciaffaglione; Pietro Di Gianantonio; Furio Honsell; Marina Lenisa (LFMTP@LICS, 2019)

LF+ in Coq for "fast and loose" reasoning. - Fabio Alessi; Alberto Ciaffaglione; Pietro Di Gianantonio; Furio Honsell; Marina Lenisa; Ivan Scagnetto (J. Formaliz. Reason., 2019)