9th International Symposium on Frontiers of Fundamental and Computational Physics (2008)
Sidharth, B G, Honsell, F, Mansutti, O, Sreenivasan, K, De Angelis, A
Abstract. We show how to characterize compositionally a number of evaluation properties of-terms using Intersection Type assignment systems. In particular, we focus on termination properties, such as...
Compositional Characterisations of λ-terms using Intersection Types ⋆ (2007)
M. Dezani-ciancaglini, F. Honsell, Y. Motohama
We show how to characterise compositionally a number of evaluation properties of λ-terms using Intersection Type assignment systems. In particular, we focus on termination properties, such as strong...
Final semantics for the-calculus (2007)
F. Honsell, M. Lenisa, U. Montanari, M. Pistore
In this paper we discuss final semantics for the-calculus, a process algebra which models systems that can dynamically change the topology of the channels. We show that the final semantics paradigm,...
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]...
‡ Corresponding author. (2006)
Furio Honsell, Marina Lenisa, Rekha Redamalla, F. Honsell, M. Lenisa, R. Redamalla
We extend Reichel-Jacobs coalgebraic account of specification and refinement of objects and classes in Object Oriented Programming to (generalized) binary methods. These are methods that take more...
Compositional Characterisations of λ-terms using Intersection Types (2005)
M. Dezani-ciancaglini, F. Honsell, Y. Motohama
We show how to characterise compositionally a number of evaluation properties of #-terms using Intersection Type assignment systems. In particular, we focus on termination properties, such as strong...
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...