F. Alessi

A Complete Characterization of Complete Intersection-Type Preorders (2007)

M. Dezani-Ciancaglini, Intersection-type Preorders, F. Honsell, F. Alessi

this paper we solve completely the characterization problem as far as the three canonical set-theoretical semantics for intersection-types: the inference semantics, the simple semantics [Scott 1975]...

A Complete Characterization of Complete Intersection-Type Preorders (2007)

Intersection-type Preorders, M. Dezani-ciancaglini, F. Honsell, F. Alessi, ...

this paper we solve completely the characterization problem as far as the three canonical set-theoretical semantics for intersection-types: the inference semantics, the simple semantics [Scott 1975]...

Tailoring Filter Models (2004)

F. Alessi, F. Barbanera, M. Dezani-ciancaglini

Conditions on type preorders are provided in order to characterize the induced filter models for the #-calculus and some of its restrictions. Besides, two examples are given of filter models in which...

Simple Easy Terms (2002)

F. Alessi, S. Lusin

We illustrate the use of intersection types as a semantic tool for proving easiness result on #-terms. We single out the notion of simple easiness for #-terms as a useful semantic property for...

Simple easy terms (2002)

F. Alessi, S. Lusin

Dipartimento di Informatica Universit`a di Venezia

Filter Models and Easy Terms (2001)

F. Alessi, M. Dezani-Ciancaglini, F. Honsell

We illustrate the use of intersection types as a tool for synthesizing -models which exhibit special purpose features. We focus on semantical proofs of easiness. This allows us to prove that the...

A Complete Characterization of Complete Intersection-Type Theories (2000)

Dezani-Ciancaglini, M., Honsell, F., Alessi, F.

We characterize those intersection-type theories which yield complete intersection-type assignment systems for lambda-calculi, with respect to the three canonical set-theoretical semantics for...

A complete characterization of the complete intersection-type theories (2000)

M. Dezani-ciancaglini, F. Honsell, F. Alessi

We characterize those intersection-type theories which yield complete intersection-type assignment systems for l-calculi, with respect to the three canonical set-theoretical semantics for...

Partializing Stone Spaces using SFP domains (Extended Abstract) (1997)

F. Alessi, P. Baldan, F. Honsell

) F. Alessi, P. Baldan, F. Honsell Dipartimento di Matematica ed Informatica via delle Scienze 208, 33100 Udine, Italy falessi, baldan, honsellg@dimi.uniud.it Abstract. In this paper we investigate...

Solutions of Functorial and Non-Functorial Metric Domain Equations (1995)

Alessi Baldan, F. Alessi, P. Baldan

A new method for solving domain equations in categories of metric spaces is studied. The categories CMS ß and KMS ß are introduced, having complete and compact metric spaces as objects and...