Results 1  10
of
22
Complete restrictions of the intersection type discipline
 Theoretical Computer Science
, 1992
"... In this paper the intersection type discipline as defined in [Barendregt et al. ’83] is studied. We will present two different and independent complete restrictions of the intersection type discipline. The first restricted system, the strict type assignment system, is presented in section two. Its m ..."
Abstract

Cited by 103 (40 self)
 Add to MetaCart
In this paper the intersection type discipline as defined in [Barendregt et al. ’83] is studied. We will present two different and independent complete restrictions of the intersection type discipline. The first restricted system, the strict type assignment system, is presented in section two. Its major feature is the absence of the derivation rule (≤) and it is based on a set of strict types. We will show that these together give rise to a strict filter lambda model that is essentially different from the one presented in [Barendregt et al. ’83]. We will show that the strict type assignment system is the nucleus of the full system, i.e. for every derivation in the intersection type discipline there is a derivation in which (≤) is used only at the very end. Finally we will prove that strict type assignment is complete for inference semantics. The second restricted system is presented in section three. Its major feature is the absence of the type ω. We will show that this system gives rise to a filter λImodel and that type assignment without ω is complete for the λIcalculus. Finally we will prove that a lambda term is typeable in this system if and only if it is strongly normalizable.
Programming with Intersection Types and Bounded Polymorphism
, 1991
"... representing the official policies, either expressed or implied, of the U.S. Government. ..."
Abstract

Cited by 66 (4 self)
 Add to MetaCart
representing the official policies, either expressed or implied, of the U.S. Government.
Intersection Type Assignment Systems
 THEORETICAL COMPUTER SCIENCE
, 1995
"... This paper gives an overview of intersection type assignment for the Lambda Calculus, as well as compare in detail variants that have been defined in the past. It presents the essential intersection type assignment system, that will prove to be as powerful as the wellknown BCDsystem. It is essenti ..."
Abstract

Cited by 61 (33 self)
 Add to MetaCart
This paper gives an overview of intersection type assignment for the Lambda Calculus, as well as compare in detail variants that have been defined in the past. It presents the essential intersection type assignment system, that will prove to be as powerful as the wellknown BCDsystem. It is essential in the following sense: it is an almost syntax directed system that satisfies all major properties of the BCDsystem, and the types used are the representatives of equivalence classes of types in the BCDsystem. The set of typeable terms can be characterized in the same way, the system is complete with respect to the simple type semantics, and it has the principal type property.
SetTheoretical and Other Elementary Models of the lambdacalculus
 Theoretical Computer Science
, 1993
"... Part 1 of this paper is the previously unpublished 1972 memorandum [43], with editorial changes and some minor corrections. Part 2 presents what happened next, together with some further development of the material. The first part begins with an elementary settheoretical model of the ficalculus. F ..."
Abstract

Cited by 40 (0 self)
 Add to MetaCart
Part 1 of this paper is the previously unpublished 1972 memorandum [43], with editorial changes and some minor corrections. Part 2 presents what happened next, together with some further development of the material. The first part begins with an elementary settheoretical model of the ficalculus. Functions are modeled in a similar way to that normally employed in set theory, by their graphs; difficulties are caused in this enterprise by the axiom of foundation. Next, based on that model, a model of the fijcalculus is constructed by means of a natural deduction method. Finally, a theorem is proved giving some general properties of those nontrivial models of the fijcalculus which are continuous complete lattices. The second part begins with a brief discussion of models of the calculus in set theories with antifoundation axioms. Next the model of the fi calculus of Part 1 and also the closely relatedbut different!models of Scott [53, 54] and of Engeler [21, 22] are reviewed....
Intersection Types and Bounded Polymorphism
, 1996
"... this paper (Compagnoni, Intersection Types and Bounded Polymorphism 3 1994; Compagnoni, 1995) has been used in a typetheoretic model of objectoriented multiple inheritance (Compagnoni & Pierce, 1996). Related calculi combining restricted forms of intersection types with higherorder polymorphism ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
this paper (Compagnoni, Intersection Types and Bounded Polymorphism 3 1994; Compagnoni, 1995) has been used in a typetheoretic model of objectoriented multiple inheritance (Compagnoni & Pierce, 1996). Related calculi combining restricted forms of intersection types with higherorder polymorphism and dependent types have been studied by Pfenning (Pfenning, 1993). Following a more detailed discussion of the pure systems of intersections and bounded quantification (Section 2), we describe, in Section 3, a typed calculus called F ("Fmeet ") integrating the features of both. Section 4 gives some examples illustrating this system's expressive power. Section 5 presents the main results of the paper: a prooftheoretic analysis of F 's subtyping and typechecking relations leading to algorithms for checking subtyping and for synthesizing minimal types for terms. Section 6 discusses semantic aspects of the calculus, obtaining a simple soundness proof for the typing rules by interpreting types as partial equivalence relations; however, another prooftheoretic result, the nonexistence of least upper bounds for arbitrary pairs of types, implies that typed models may be more difficult to construct. Section 7 offers concluding remarks. 2. Background
Compositional Characterizations of λterms using Intersection Types (Extended Abstract)
, 2000
"... 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 strong normalization, normalization, head normalization, and weak head normalization. We consider also the ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
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 strong normalization, normalization, head normalization, and weak head normalization. We consider also the persistent versions of such notions. By way of example, we consider also another evaluation property, unrelated to termination, namely reducibility to a closed term. Many of these characterization results are new, to our knowledge, or else they streamline, strengthen, or generalize earlier results in the literature. The completeness parts of the characterizations are proved uniformly for all the properties, using a settheoretical semantics of intersection types over suitable kinds of stable sets. This technique generalizes Krivine 's and Mitchell's methods for strong normalization to other evaluation properties.
Some Results on the Full Abstraction Problem for Restricted Lambda Calculi
 In Proc. of the 18 th International Symposium on Mathematical Foundations of Computer Science, MFCS'93, Springer LNCS
, 1993
"... ion Problem for Restricted Lambda Calculi Furio Honsell and Marina Lenisa Dipartimento di Matematica e Informatica, Universit`a di Udine, via Zanon,6  Italy Email:fhonsell,lenisag@udmi5400.cineca.it dedicated to Corrado Bohm on the occasion of his 70 th birthday Abstract. Issues in the mathemat ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
ion Problem for Restricted Lambda Calculi Furio Honsell and Marina Lenisa Dipartimento di Matematica e Informatica, Universit`a di Udine, via Zanon,6  Italy Email:fhonsell,lenisag@udmi5400.cineca.it dedicated to Corrado Bohm on the occasion of his 70 th birthday Abstract. Issues in the mathematical semantics of two restrictions of the calculus, i.e. Icalculus and V calculus, are discussed. A fully abstract model for the natural evaluation of the former is defined using complete partial orders and strict Scottcontinuous functions. A correct, albeit nonfully abstract, model for the SECD evaluation of the latter is defined using Girard's coherence spaces and stable functions. These results are used to illustrate the interest of the analysis of the fine structure of mathematical models of programming languages. 1 Introduction D. Scott, in the late sixties, discovered a truly mathematical semantics for  calculus using continuous lattices. His D1 model was the first example of ...
Filter Models and Easy Terms
, 2001
"... 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 class of theories induced by graph models is strictly included in the class of theories induced by n ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
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 class of theories induced by graph models is strictly included in the class of theories induced by nonextensional lter models.
Simple easy terms
 Intersection Types and Related Systems, volume 70 of Electronic Notes in Computer Science
, 2002
"... Dipartimento di Informatica Universit`a di Venezia ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Dipartimento di Informatica Universit`a di Venezia
A Complete Characterization of Complete IntersectionType Theories (Extended Abstract)
 ACM TOCL
, 2000
"... M. DEZANICIANCAGLINI Universita di Torino, Italy F. HONSELL Universita di Udine, Italy F. ALESSI Universita di Udine, Italy Abstract We characterize those intersectiontype theories which yield complete intersectiontype assignment systems for lcalculi, with respect to the three canonical ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
M. DEZANICIANCAGLINI Universita di Torino, Italy F. HONSELL Universita di Udine, Italy F. ALESSI Universita di Udine, Italy Abstract We characterize those intersectiontype theories which yield complete intersectiontype assignment systems for lcalculi, with respect to the three canonical settheoretical semantics for intersectiontypes: the inference semantics, the simple semantics and the Fsemantics. Keywords Lambda Calculus, Intersection Types, Semantic Completeness, Filter Structures. 1 Introduction Intersectiontypes disciplines originated in [6] to overcome the limitations of Curry 's type assignment system and to provide a characterization of strongly normalizing terms of the lcalculus. But very early on, the issue of completeness became crucial. Intersectiontype theories and filter lmodels have been introduced, in [5], precisely to achieve the completeness for the type assignment system l" BCD W , with respect to Scott's simple semantics. And this result, ...