M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In J.-C. Raoult, editor, 17th Colloquium on Trees in Algebra and Programming, Rennes, France, pages 102--123, Berlin, February 1992. Springer-Verlag LNCS 581. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
The Essence of Principal Typings - Wells (2002) (51 citations) (Correct)
....definitions, separate compilation, and accurate error messages [15] Successors to Jim s method include Banerjee s [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 ....
M. Coppo, P. Giannini. A complete type inference algorithm for simple intersection types. In 17th Colloq. Trees in Algebra and Programming, vol. 581 of LNCS. Springer-Verlag, 1992.
Type Inference With Set Theoretic Type Operators - Damm (1994) (Correct)
....appeared in connection with the intersection type discipline [CDCV80] Type inference in this system is undecidable and the system is usually studied in connection with semantic properties of the calculus. However, some decidable restrictions of the intersection type discipline have been proposed [CG92, DG94]. Intersection types have also been studied in connection with bounded polymorphism [Pie93] but since this work also involves high order polymorphism, the problems considered are somewhat different to ours. Outline In Section 2 we show how type inference in the type system depicted in Figure 1 ....
M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In J.-C. Raoult, editor, Proceedings of 17th Colloquium on Trees in Algebra and Programming (CAAP'92), volume 581 of Lecture Notes in Computer Science, pages 102--123. Springer-Verlag, 1992.
From Polyvariant Flow Information to Intersection and Union.. - Palsberg, Pavlopoulou (2000) (27 citations) (Correct)
....from ows to types. Provide a type inference algorithm for a large subset of our type system, perhaps a rank 2 fragment in the spirit of Jim [35] Our type system with intersection and union types is more generous than usually found in papers on type inference with intersection types [15, 64, 34, 9]. Prove a principal ow property for our family of ow analyses, in the spirit of the result by Nielson and Nielson [46] Extend the results to a combination of our framework and the framework of Nielson and Nielson. Prove an equivalence which is based on that the ow analyses have it ....
Mario Coppo and Paola Giannini. A complete type inference algorithm for simple intersection types. In Proceedings of CAAP'92, pages 102{ 123. Springer-Verlag (LNCS 581), 1992. 73
Principal Type Schemes for the Strict Type Assignment System - van Bakel (1993) (6 citations) (Correct)
....types in functional programming languages. Since the strict system is closed under fi equality, type assignment in this system is not decidable, but semi decidable. This means of course that in an implementation of the strict system some restrictions have to be made, as is done for example in [10] and [2] Limiting the notion of type assignment by restricting the situations in which the derivation rules can be applied (the technique used in [10] or by limiting the structure of types (as is done in [2] changes the notion of type assignment, and, therefore, also the principal types for ....
....semi decidable. This means of course that in an implementation of the strict system some restrictions have to be made, as is done for example in [10] and [2] Limiting the notion of type assignment by restricting the situations in which the derivation rules can be applied (the technique used in [10]) or by limiting the structure of types (as is done in [2] changes the notion of type assignment, and, therefore, also the principal types for these systems differ. The general outline of this paper is as follows: in Section 2 we present the strict type assignment system. In Section 4 we define ....
M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In J.-C. Raoult, editor, Proceedings of CAAP '92. 17th Colloquim on Trees in Algebra and Programming, Rennes, France, volume 581 of Lecture Notes in Computer Science, pages 102--123. Springer-Verlag, 1992.
Refinement Types for ML - Freeman (1994) (52 citations) (Correct)
....(int int) real real) When the type system uses the type of unary negation, it will have to select an appropriate type from the ones intersected. These types can quickly become too expressive; type inference becomes undecidable [CDCV80] There are restrictions that yield a decidable system [CG92] but it is not clear what subtyping means in this system. Another variant of this is Forsythe [Rey88] This language has intersection types and subtyping, but no polymorphism. This language has a different approach to records from the polymorphic one mentioned above: the intersection of the two ....
M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In J.-C. Raoult, editor, 17th Colloquiumon Trees in Algebra and Programming, Rennes, France, pages 102--123, Berlin, February 1992. Springer-Verlag LNCS 581.
Intersection Types for a Logical Framework - Frank Pfenning School (Correct)
No context found.
M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In J.-C. Raoult, editor, 17th Colloquium on Trees in Algebra and Programming, Rennes, France, pages 102--123, Berlin, February 1992. Springer-Verlag LNCS 581.
Refinement Types for ML - Freeman (1994) (54 citations) (Correct)
No context found.
M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In J.-C. Raoult, editor, 17th Colloquiumon Trees in Algebra and Programming, Rennes, France, pages 102--123, Berlin, February 1992. Springer-Verlag LNCS 581.
Refinement Types for Logical Frameworks - Frank Pfenning Department (1993) (27 citations) (Correct)
No context found.
M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In J.-C. Raoult, editor, 17th Colloquium on Trees in Algebra and Programming, Rennes, France, pages 102--123, Berlin, February 1992. Springer-Verlag LNCS 581.
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (4 citations) (Correct)
No context found.
M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In 17th Colloq. Trees in Algebra and Programming, vol. 581 of LNCS, pp. 102--123. Springer-Verlag, 1992.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (1996) (Correct)
No context found.
Coppo, M. and Giannini, P., "A Complete Type Inference Algorithm for Simple Intersection Types", 17th Colloquium on Trees in Algebra and Programming, CAAP 92, LNCS 581, pp 102-123, 1992.
Beta-Reduction As Unification - Kfoury (1996) (8 citations) (Correct)
No context found.
Coppo, M., and Giannini, P., \A complete type inference algorithm for simple intersection types", in Proceedings of CAAP '92, 17th Colloquium on Trees in Algebras and Programming, ed. J.-C. Raoult, Rennes, France. LNCS Vol 581, pp 102-123, Springer-Verlag, 1992.
The Essence of Principal Typings - Wells (2002) (51 citations) (Correct)
No context found.
M. Coppo, P. Giannini. A complete type inference algorithm for simple intersection types. In 17th Colloq. Trees in Algebra and Programming, vol. 581 of LNCS. Springer-Verlag, 1992.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (2000) (Correct)
No context found.
Coppo, M. and Giannini, P., \A Complete Type Inference Algorithm for Simple Intersection Types", 17th Colloquium on Trees in Algebra and Programming, CAAP 92, LNCS 581, pp 102-123, 1992.
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (4 citations) (Correct)
No context found.
M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In 17th Colloq. Trees in Algebra and Programming, vol. 581 of LNCS, pp. 102--123. Springer-Verlag, 1992.
Principality and Decidable Type Inference for Finite-Rank.. - Kfoury, Wells (1998) (19 citations) (Correct)
No context found.
M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In 17th Colloq. Trees in Algebra and Programming,vol. 581 of LNCS, pp. 102--123. Springer-Verlag, 1992.
Principality and Decidable Type Inference for Finite-Rank.. - Kfoury, Wells (1998) (19 citations) (Correct)
No context found.
M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In 17th Colloq. Trees in Algebra and Programming, vol. 581 of LNCS, pp. 102--123. Springer-Verlag, 1992.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (1996) (Correct)
No context found.
Coppo, M. and Giannini, P., "A Complete Type Inference Algorithm for Simple Intersection Types", 17th Colloquium on Trees in Algebra and Programming, CAAP 92, LNCS 581, pp 102-123, 1992.
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (4 citations) (Correct)
No context found.
M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In 17th Colloq. Trees in Algebra and Programming, vol. 581 of LNCS, pp. 102--123. Springer-Verlag, 1992.
Beta-Reduction As Unification - Kfoury (1996) (8 citations) (Correct)
No context found.
Coppo, M., and Giannini, P., "A complete type inference algorithm for simple intersection types", in Proceedings of CAAP '92, 17th Colloquium on Trees in Algebras and Programming, ed. J.-C. Raoult, Rennes, France. LNCS Vol 581, pp 102-123, Springer-Verlag, 1992.
Analyse Statique De Programmes : Fondements Et Applications - Jensen (1999) (Correct)
No context found.
M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In Jean-Claude Raoult, editor, Proc. of CAAP '92, 17th Colloquium on Trees in Algebra and Programming, LNCS vol. 581, pages 102--123. SpringerVerlag, 1992.
A Type System Equivalent to Model Checking - Naik (2003) (Correct)
No context found.
Mario Coppo and Paola Giannini. A complete type inference algorithm for simple intersection types. In Proceedings of CAAP'92, pages 102-123. Springer-Verlag (LNCS 581), 1992.
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (4 citations) (Correct)
No context found.
M. Coppo and P. Giannini. A complete type inference algorithm for simple intersection types. In 17th Colloq. Trees in Algebra and Programming, vol. 581 of LNCS, pp. 102--123. Springer-Verlag, 1992.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (2000) (Correct)
No context found.
Coppo, M. and Giannini, P., "A Complete Type Inference Algorithm for Simple Intersection Types", 17th Colloquium on Trees in Algebra and Programming, CAAP 92, LNCS 581, pp 102-123, 1992.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (1996) (Correct)
No context found.
Coppo, M. and Giannini, P., "A Complete Type Inference Algorithm for Simple Intersection Types", 17th Colloquium on Trees in Algebra and Programming, CAAP 92, LNCS 581, pp 102-123, 1992.
The Essence of Principal Typings - Wells (2002) (51 citations) (Correct)
No context found.
M. Coppo, P. Giannini. A complete type inference algorithm for simple intersection types. In 17th Colloq. Trees in Algebra and Programming, vol. 581 of LNCS. Springer-Verlag, 1992.
First 50 documents
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