A.J. Kfoury, J.B. Wells, Principality and decidable type inference for finite-rank intersection types, Theoretical Comput. Sci. Vol. 311 No. 1 (####) 1-70. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
ML^F: Raising ML to the Power of System F - Le Botlan, Rémy (2003) (Correct)
....types at rank 2 or higher must be given explicitly and the interaction of annotations with implicit types remains unclear. Furthermore, to the best of our knowledge, this has not yet been formalized. Indeed, type inference is undecidable as soon as universal quantifiers may appear at rank 3 [14]. Although our proposal relies on the let binding mechanism to introduce implicit polymorphismand flexible bounds in types to factorize all ways of obtaining type instances, there may still be some connection with intersection types [12] which we would like to explore. Our treatment of ....
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In ACM Symposium on Principles of Programming Languages (POPL), pages 161--174. ACM, Jan. 1999.
Raising ML to the Power of System F - Le Botlan, Remy (2003) (4 citations) (Correct)
....types at rank 2 or higher must be given explicitly and the interaction of annotations with implicit types remains unclear. Furthermore, to the best of our knowledge, this has not yet been formalized. Indeed, type inference is undecidable as soon as universal quantifiers may appear at rank 3 [KW99] Although our proposal relies on the ML let binding mechanism to introduce implicit polymorphism even for annotations and flexible bounds in types to factorize all ways of obtaining type instances, rather than on intersection types, there may still be some connection with intersection types ....
Assaf J. Kfoury and Joe B. Wells. Principality and decidable type inference for finite-rank intersection types. In ACM Symposium on Principles of Programming Languages (POPL), San Antonio, Texas, pages 161--174, New York, NY, January 1999. ACM.
Principal Typing and Mutual Recursion - Figueiredo, Camarão (2001) (Correct)
.... our rule for typing polymorphic recursion is based on the same idea as the rule proposed in [Myc84] This uses a kind of transformation from in nitary to nitary polymorphism, in a similar way to (rank 2) type systems of intersection types (which have decidable type inference of principal typings [KW99]) Our conjecture is that this is the main reason that enabled us to achieve decidable type inference for mutually recursive de nitions. 7 Conclusion We have presented a type system (ML 0 ) and a type inference algorithm (T o ) for typing core ML expressions extended with mutually recusive ....
A. J. Kfoury and J. B. Wells. Principality and Decidable Type Inference for Finite-Rank Intersection Types. In POPL'99 ACM-SIGPLAN Symposium on the Principles of Programming Languages, 1999.
Polymorphic Intersection Type Assignment for.. - van Bakel.. (2001) (1 citation) (Correct)
....in particular if we consider types of rank 2 [27] Intersection type systems [12] are somewhere in the middle with respect to polymorphism, and have principal typings. But type assignment is again undecidable; decidability is recovered if we restrict ourselves to intersection types of finite rank [29]. In [24] a system for LC combining intersection types and System F was presented, which has principal typings (see [32] In this paper we extend the approach of that system to a combination of LC and CuTRS. In other words, we extend the type system of [7] further, adding as an extra ....
A.J. Kfoury and J.B. Wells. Principality and decidable type inference for finite-rank intersection types. In 34 Proceedings 26' ACM Symposium on Principles of Programming Languages, pages 161--174, 1999.
Principal Typing and Mutual Recursion - Figueiredo, Camarao (2001) (Correct)
.... Our rule (FIX 0 ) is based essentially on the same idea of the rule proposed in [Myc84] that uses a kind of transformation from in nitary to nitary polymorphism, in a similar way to (rank 2) type systems of intersection types (which have decidable type inference of principal typings [KW99]) This avoids typability of expressions to be constrained by the solution of a set of semi uni cation inequations, generating, instead, constraints that are expressed as a limited sequence of uni cation equations between simple types. 7 Conclusion We have presented a type system (ML 0 ) and a ....
A. J. Kfoury and J. B. Wells. Principality and Decidable Type Inference for Finite-Rank Intersection Types. In POPL'99 ACM-SIGPLAN Symposium on the Principles of Programming Languages. ACM Press, 1999.
Relating Typability and Expressiveness in Finite-Rank.. - Kfoury, Mairson (1999) (Correct)
....inference. The finite rank restriction on intersection types bounds how deeply the # can appear in type expressions, counting nesting in the left arguments of the # type constructor. Recently it has been shown that finite rank intersection types have computable type inference for any rank [KW99]. As such, they provide a conceptually simple alternative to the impredicative polymorphism of System F and its extensions, supporting a pragmatics for implement ing parametric polymorphism. Finite rank intersection types are being investigated in the context of the Church Project s ....
....acceptable in practice.We are implementing type inference algorithms for finite rank intersection types and evaluating their tractability in practice. The Infer I(k) algorithm infers types for a type system with ACI intersection types. In contrast, the finiterank inference algorithm presented in [KW99] uses nonACI intersection types, which is not as flexible. However, the system of [KW99] is substitution unificationbased and guarantees principal typings. We are investigating an algorithm that has these advantages for ACI intersection types. ....
[Article contains additional citation context not shown here]
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pp. 161-- 174, 1999.
Principal Typing and Mutual Recursion - Figueiredo, Camarão (2001) (Correct)
.... our rule for typing polymorphic recursion is based on the same idea as the rule proposed in [Myc84] This uses a kind of transformation from in nitary to nitary polymorphism, in a similar way to (rank 2) type systems of intersection types (which have decidable type inference of principal typings [KW99]) Our conjecture is that this is the main reason that enabled us to achieve decidable type inference for mutually recursive de nitions. 7 Conclusion We have presented a type system (ML 0 ) and a type inference algorithm (T o ) for typing core ML expressions extended with mutually recusive ....
A. J. Kfoury and J. B. Wells. Principality and Decidable Type Inference for Finite-Rank Intersection Types. In POPL'99 ACM-SIGPLAN Symposium on the Principles of Programming Languages, 1999.
Expansion: the Crucial Mechanism for Type Inference with.. - Carlier, Wells (2004) (1 citation) Self-citation (Wells) (Correct)
No context found.
Assaf J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pages 161--174, 1999. Superseded by [33].
Unknown - Expansion Variables For Self-citation (Kfoury Wells) (Correct)
No context found.
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In POPL '99 [14]. Superseded by [10].
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (4 citations) Self-citation (Kfoury Wells) (Correct)
No context found.
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pp. 161--174, 1999. Superseded by [KW02].
Implementing Compositional Analysis Using Intersection.. - Kfoury, Washburn, Wells (2003) (3 citations) Self-citation (Kfoury Wells) (Correct)
No context found.
Assaf J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pages 161--174, 1999.
System E: Expansion Variables for Flexible Typing.. - Carlier, Polakow.. (2004) Self-citation (Kfoury Wells) (Correct)
No context found.
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In POPL '99 [14]. Superseded by [10].
Principal Typings for All Normalizable Terms in the System.. - Schwartz, Kfoury (2003) Self-citation (Kfoury) (Correct)
No context found.
Assaf J. Kfoury and J. B. Wells. Principality and decidable type inference for finiterank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pages 161--174, 1999. Superseded by [KW02].
Expansion: the Crucial Mechanism for Type Inference with.. - Carlier, Wells (2004) (1 citation) Self-citation (Wells) (Correct)
No context found.
Assaf J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pages 161--174, 1999. Superseded by [33].
Type Inference with Expansion Variables and Intersection.. - Carlier, Wells (5 citations) Self-citation (Wells) (Correct)
No context found.
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finiterank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., 1999. Superseded by [21].
Expansion: the Crucial Mechanism for Type Inference with.. - Carlier, Wells (2005) (1 citation) Self-citation (Wells) (Correct)
No context found.
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., 1999. Superseded by [38].
The Essence of Principal Typings - Wells (2002) (51 citations) Self-citation (Wells) (Correct)
No context found.
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., 1999.
Exact Intersection Typing Inference and Call-by-Name.. - Adam Bakewell Sebastien (2004) Self-citation (Kfoury Wells) (Correct)
No context found.
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pp. 161--174, 1999. Superseded by [16].
Implementing Compositional Analysis Using Intersection Types.. - Kfoury, al. (2002) (3 citations) Self-citation (Kfoury Wells) (Correct)
No context found.
Assaf J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pages 161--174, 1999. Superseded by [12].
Type Inference with Expansion Variables and Intersection.. - Carlier, Wells (2004) (5 citations) Self-citation (Wells) (Correct)
No context found.
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., 1999. Superseded by [22].
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (4 citations) Self-citation (Kfoury Wells) (Correct)
No context found.
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pp. 161--174, 1999. Superseded by [KW02].
System E: Expansion Variables for Flexible Typing.. - Carlier, Polakow.. (2004) Self-citation (Kfoury Wells) (Correct)
No context found.
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In POPL '99 [16]. Superseded by [12].
Type Inference with Expansion Variables and Intersection.. - Carlier, Wells (5 citations) Self-citation (Wells) (Correct)
No context found.
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finiterank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., 1999. Superseded by [18].
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (4 citations) Self-citation (Kfoury Wells) (Correct)
No context found.
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pp. 161--174, 1999. Superseded by [KW02].
System E: Expansion Variables for Flexible Typing.. - Carlier, Polakow.. Self-citation (Kfoury Wells) (Correct)
No context found.
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In POPL '99 [14]. Superseded by [10].
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (4 citations) Self-citation (Kfoury Wells) (Correct)
No context found.
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pp. 161--174, 1999. Superseded by [KW02].
Type Inference with Expansion Variables and Intersection.. - Carlier, Wells (5 citations) Self-citation (Wells) (Correct)
No context found.
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., 1999. Superseded by [22].
Unknown - Expansion Variables For Self-citation (Kfoury Wells) (Correct)
No context found.
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In POPL '99 [14]. Superseded by [10].
The Essence of Principal Typings - Wells (2002) (51 citations) Self-citation (Wells) (Correct)
No context found.
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., 1999.
Implementing Compositional Analysis Using Intersection.. - Kfoury, Washburn, Wells (2003) (3 citations) Self-citation (Kfoury Wells) (Correct)
No context found.
Assaf J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pages 161--174, 1999.
The Essence of Principal Typings - Wells (2002) (51 citations) Self-citation (Wells) (Correct)
.... inference algorithm [31] Along the way, there have been a few positive results, some extensions of the HM system, but, perhaps more interestingly, some with restricted intersection types (cf. recent work on intersection types of arbitrarily high finite ranks by Kfoury, Mairson, Turbak, and Wells [19, 17]) A New Principal Typing Definition vs. Quantifiers For many years it was not known whether type systems with quantifiers could have principal typings. The first di#culty is simply in finding a su#ciently general systemindependent definition of principal typings. The first such definition ....
....[1] which integrates flow analysis, and Jensen s [13] which integrates strictness analysis. Other approaches to principal typings and type inference with intersection types include [5] and [12] The most recent development in this area is the introduction of the notion of expansion variables [19]. The key idea is that with expansion variables, the earlier notions of expansion and substitution can be integrated in a single notion of substitution called # substitution. This results in a great simplification over earlier approaches beyond the rank 2 restriction. However, there are still many ....
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., 1999.
Branching Types - Wells, Haack (2002) Self-citation (Wells) (Correct)
....[20] proved the # term (#x.z(x(#fu.fu) x(#vg.gv) #y.yyy) to be untypable in the system F# , considered to be the most powerful type system with measured by the set of pure # terms it can type. In contrast, this # term is typable with intersection types satisfying the rank 3 restriction [12]. Better results for automated type inference (ATI) have also been obtained for intersection types. ATI for type systems with that are more powerful than the very restricted Hindley Milner system is a murky area, This work was partly supported by NSF grants CCR 9113196, 9417382, 9988529, and ....
.... and it has been proven for many such type systems that ATI algorithms can not be both complete and terminating [11, 23, 24, 20] In contrast, ATI algorithms have been proven complete and terminating for the rank k restriction for every finite k for several systems with intersection types [12, 10]. We use intersection types in typed intermediate languages (TILs) used in compilers. Using a TIL increases reliability of compilation and can support useful type directed program transformations. We use intersection types because they support both more accurate analyses (as mentioned above) and ....
A. J. Kfoury, J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pp. 161--174, 1999.
Branching Types - Wells, Haack (2002) Self-citation (Wells) (Correct)
....E mail: jbw cee.hw.ac.uk. Web: http: www.cee.hw.ac.uk jbw . to be untypable in the system F# , considered to be the most powerful type system with measured by the set of pure # terms it can type. In contrast, this # term is typable with intersection types satisfying the rank 3 restriction [KW99]. Second, better results for automated type inference (ATI) have also been obtained for intersection types. ATI for type systems with that are more powerful than the very restricted Hindley Milner system is a murky area, and it has been proven for many such type systems that ATI algorithms can ....
.... it has been proven for many such type systems that ATI algorithms can not be both complete and terminating [KW94, Wel96, Wel99, Urz97] In contrast, ATI algorithms have been proven complete and terminating for the rank k restriction for every finite k for several systems with intersection types [KW99, KMTW99]. Finally, intersection type systems often have the principal typing property, which facilitates modular program analysis [Wel02, KW99, Ban97, Jim95] To obtain the advantages mentioned above, we use intersection types in typed intermediate languages (TILs) used in compilers. Using a TIL ....
[Article contains additional citation context not shown here]
Assaf J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pages 161--174, 1999.
Program Representation Size in an Intermediate.. - Dimock.. (2001) Self-citation (Wells) (Correct)
....# # int, real .#x # .x. Although this notation is more compact, it makes type information less accessible and can be tricky to adapt to more complex situations [WDMT0X] We have made preliminary investigations into other representations, e.g. one based on the skeletons and substitutions of [KW99] Based on the empirical results presented here, we believe that developing a non duplicating representation of CIL may be not critical (though it may still be worthwhile) However, only one of the flow analyses we have experimented with to date expresses a non trivial form of polyvariance, so it ....
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pp. 161--174, 1999. 19
Relating Typability and Expressiveness in Finite-Rank .. - Kfoury, Mairson.. (1999) Self-citation (Kfoury Wells) (Correct)
....type inference. The finite rank restriction on intersection types bounds how deeply the can appear in type expressions, counting nesting in the left arguments of the type constructor. Recently it has been shown that finite rank intersection types have computable type inference for any rank [KW99]. As such, they provide a conceptually simple alternative to the impredicative polymorphism of System F and its extensions, supporting a pragmatics for implement ing parametric polymorphism. Finite rank intersection types are being investigated in the context of the Church Project s experimental ....
....acceptable in practice.We are implementing type inference algorithms for finite rank intersection types and evaluating their tractability in practice. The Infer I(k) algorithm infers types for a type system with ACI intersection types. In contrast, the finiterank inference algorithm presented in [KW99] uses nonACI intersection types, which is not as flexible. However, the system of [KW99] is substitution unificationbased and guarantees principal typings. We are investigating an algorithm that has these advantages for ACI intersection types. ....
[Article contains additional citation context not shown here]
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Principles of Prog. Languages, 1999.
On Type Inference - In The Intersection (Correct)
No context found.
A.J. Kfoury, J.B. Wells, Principality and decidable type inference for finite-rank intersection types, Theoretical Comput. Sci. Vol. 311 No. 1 (####) 1-70.
On Type Inference in the - Intersection Type Discipline (Correct)
No context found.
A.J. Kfoury, J.B. Wells, Principality and decidable type inference for finite-rank intersection types, Theoretical Comput. Sci. Vol. 311 No. 1 (2004) 1-70.
Unknown - Ist- Dynamic Assembly (Correct)
No context found.
Assaf J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pages 161--174, 1999. Superseded by [KW04].
Typing Weakly Normalizable Terms via Intersection Types and.. - Schwartz (2003) (Correct)
No context found.
Assaf J. Kfoury and J.B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. Of Prog. Langs., pages 161-174, 1999.
Rank Bounded Intersection: Types, Potency, and Idempotency - Neergaard, Mairson (2003) (Correct)
No context found.
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finiterank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pages 161--174, 1999. Referenced on pp. 5, 6, 7, 10
Rank 2 Intersection Types for Local Definitions and Conditional.. - Damiani (2003) (15 citations) (Correct)
No context found.
KFOURY,A.J.AND WELLS, J. B. 1999. Principality and Decidable Type Inference for Finite-Rank Intersection Types. In POPL'99. ACM, 161--174.
Types, Potency, and Idempotency: Why Nonlinearity and.. - Neergaard, Mairson (2004) (Correct)
No context found.
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pages 161--174, 1999.
On Type Inference in the Intersection Type Discipline - Boudol, Zimmer (2004) (3 citations) (Correct)
No context found.
A.J. Kfoury, J.B. Wells, Principality and decidable type inference for finite-rank intersection types, Theoretical Comput. Sci. Vol. 311 No. 1 (####) 1-70.
ML^F - Raising ML to the Power of System F - Le Botlan, Rémy (Correct)
No context found.
Assaf J. Kfoury and Joe B. Wells. Principality and decidable type inference for finite-rank intersection types. In ACM Symposium on Principles of Programming Languages (POPL), San Antonio, Texas, pages 161--174, New York, NY, January 1999. ACM.
A Calculus for Link-time Compilation - Machkasova, Turbak (2000) (23 citations) (Correct)
No context found.
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pp. 161--174, 1999.
Relating Typability and Expressiveness in Finite-Rank .. - Kfoury, Mairson.. (1999) (Correct)
No context found.
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., pp. 161-- 174, 1999.
A Computationally Sound Call-by-Value Module Calculus - Machkasova, Turbak (2001) (Correct)
No context found.
A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In POPL '99 [POPL99], pp. 161--174.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC