Expansion: The crucial mechanism for type inference with intersection types: A survey and explanation

Electronic Notes in Theoretical Computer Science

Volumn 136, Issue , 2005, Pages 173-202

  Carlier, Sébastien ^a   Wells, J B ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Expansion; Intersection types; Type inference

Indexed keywords

INTERSECTION TYPES; LINEAR LOGIC; REASONING; TYPE INTERFERENCE;

COMPUTER PROGRAMMING; DATA ACQUISITION; EXPANSION; INFORMATION ANALYSIS; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING; SEMANTICS;

CONSTRAINT THEORY;

EID: 21744461809     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.03.026     Document Type: Conference Paper

References (46)

1. Adam Bakewell and Assaf J. Kfoury. Unification with expansion variables. Technical report, Department of Computer Science, Boston University, December 2004
2. Anindya Banerjee A modular, polyvariant, and type-based closure analysis Proc. 1997 Int'l Conf. Functional Programming 1997 ACM Press
3. Henk Barendregt, Mario Coppo, and Mariangiola Dezani-Ciancaglini A filter lambda model and the completeness of type assignment J. Symbolic Logic 48 4 1983 931 940
4. Sébastien Carlier. Polar type inference with intersection types and ω. In ITRS '02 [22]
5. Sébastien Carlier, Jeff Polakow, J.B. Wells, and A.J. Kfoury System E: Expansion variables for flexible typing with linear and non-linear types and intersection types Programming Languages & Systems, 13th European Symp. Programming LNCS volume 2986 2004 Springer-Verlag 294 309
6. Sébastien Carlier and J.B. Wells. Type inference with expansion variables and intersection types in System E and an exact correspondence with β-reduction. In Proc. 6th Int'l Conf. Principles & Practice Declarative Programming, 2004. Completely supersedes [7]
7. Sébastien Carlier and J.B. Wells. Type inference with expansion variables and intersection types in System E and an exact correspondence with β-reduction. Technical Report HW-MACS-TR-0012, Heriot-Watt Univ., School of Math. & Comput. Sci., January 2004. Completely superseded by [6]
8. M. Coppo, F. Damiani, and P. Giannini Strictness, totality, and non-standard type inference Theoret. Comput. Sci. 272 1-2 February 2002 69 111
9. Mario Coppo, and Mariangiola Dezani-Ciancaglini A new type-assignment for lambda terms Archiv für Mathematische Logik 19 1978 139 156
10. Mario Coppo, and Mariangiola Dezani-Ciancaglini An extension of the basic functionality theory for the λ-calculus Notre Dame J. Formal Logic 21 4 1980 685 693
11. Mario Coppo, Mariangiola Dezani-Ciancaglini, and Betti Venneri Principal type schemes and λ-calculus semantics J. R[oger] Hindley J[onathan] P. Seldin To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism 1980 Academic Press 535 560
12. Mario Coppo, and Paola Giannini Principal types and unification for simple intersection type systems Inform. & Comput. 122 1 1995 70 96
13. F. Damiani Rank 2 intersection types for local definitions and conditional expressions ACM Trans. on Prog. Langs. & Systs. 25 4 2003 401 451
14. F. Damiani. Rank 2 intersection types for modules. In Proc. 5th Int'l Conf. Principles & Practice Declarative Programming, pages 67-78, 2003
15. F. Damiani, and P. Giannini Automatic useless-code detection and elimination for HOT functional programs J. Funct. Programming 2000 509 559
16. Ferruccio Damiani A conjunctive type system for useless-code elimination Math. Structures Comput. Sci. 13 2003 157 197
17. Mariangiola Dezani, Robert Meyer, and Yoko Motohama The semantics of entailment omega Notre Dame J. Formal Logic 43 3 2002 129 145
18. Paola Giannini, Furio Honsell, and Simona Ronchi Della Rocca Type inference: Some results, some problems Fund. Inform. 19 1/2 September/October 1993 87 125
19. J[ean]-Y[ves], Girard, Interprétation Fonctionnelle et Elimination des Coupures de l'Arithmétique d'Ordre Supérieur. Thèse d'Etat, Université de Paris VII, 1972
20. Christian Haack, and J.B. Wells Type error slicing in implicitly typed, higher-order languages Programming Languages & Systems, 12th European Symp. Programming LNCS volume 2618 2003 Springer-Verlag 284 301 Superseded by [21]
21. Christian Haack, and J.B. Wells Type error slicing in implicitly typed, higher-order languages Sci. Comput. Programming 50 2004 189 224 Supersedes [20]
22. Proceedings of the 2nd Workshop on Intersection Types and Related Systems, 2002.
23. The ITRS '02 proceedings appears as vol. 70, issue 1 of Elec. Notes in Theoret. Comp. Sci
24. Thomas Jensen. Inference of polymorphic and conditional strictness properties. In Conf. Rec. POPL '98: 25th ACM Symp. Princ. of Prog. Langs., 1998
25. Trevor Jim. What are principal typings and what are they good for? In Conf. Rec. POPL '96: 23rd ACM Symp. Princ. of Prog. Langs., 1996
26. Assaf J. Kfoury. Beta-reduction as unification. A refereed extensively edited version is [27]. This preliminary version was presented at the Helena Rasiowa Memorial Conference, July 1996
27. Assaf J. Kfoury. A linearization of the lambda-calculus. A refereed version is [28]. This version was presented at the Glasgow Int'l School on Type Theory & Term Rewriting, September 1996
28. Assaf J. Kfoury Beta-reduction as unification D. Niwinski Logic, Algebra, and Computer Science, (H. Rasiowa Memorial Conference, December 1996) Banach Center Publication Volume 46 1999 Springer-Verlag 137 158 Supersedes [25] but omits a few proofs included in the latter
29. Assaf J. Kfoury A linearization of the lambda-calculus J. Logic Comput. 10 3 2000 Special issue on Type Theory and Term Rewriting. Kamareddine and Klop (editors)
30. Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Turbak, and J.B. Wells Relating typability and expressibility in finite-rank intersection type systems Proc. 1999 Int'l Conf. Functional Programming 1999 ACM Press 90 101
31. Assaf J. Kfoury, Geoff Washburn, and J.B. Wells. Implementing compositional analysis using intersection types with expansion variables. In ITRS '02 [22]. The ITRS '02 proceedings appears as vol. 70, issue 1 of Elec. Notes in Theoret. Comp. Sci
32. 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]
33. Assaf J. Kfoury and J.B. Wells. Principality and type inference for intersection types using expansion variables. Supersedes [31], August 2003
34. Assaf J. Kfoury, and J.B. Wells Principality and type inference for intersection types using expansion variables Theoret. Comput. Sci. 311 1-3 2004 1 70 Supersedes [31]. For omitted proofs, see the longer report [32]
35. E.K.G. Lopez-Escobar Proof-functional connectives C. Di Prisco Methods of Mathematical Logic, Proceedings of the 6th Latin-American Symposium on Mathematical Logic, Caracas 1983 Lecture Notes in Mathematics volume 1130 1985 Springer-Verlag 208 221
36. Robin Milner A theory of type polymorphism in programming J. Comput. System Sci. 17 1978 348 375
37. Laurent Regnier. Lambda calcul et réseaux. PhD thesis, University Paris 7, 1992
38. J.C. Reynolds Towards a theory of type structure Colloque sur la Programmation LNCS volume 19 1974 Springer-Verlag 408 425
39. Simona Ronchi Della Rocca Principal type schemes and unification for intersection type discipline Theoret. Comput. Sci. 59 1-2 March 1988 181 209
40. Simona Ronchi Della Rocca, and Betti Venneri Principal type schemes for an extended type theory Theoret. Comput. Sci. 28 1-2 January 1984 151 169
41. Patrick Sallé Une extension de la théorie des types en λ-calcul G. Ausiello Corrado Böhm Fifth International Conference on Automata, Languages and Programming LNCS volume 62 July 1978 Springer-Verlag 398 410
42. Émilie Sayag and Michel Mauny. A new presentation of the intersection type discipline through principal typings of normal forms. Technical Report RR-2998, INRIA, October 16, 1996
43. ω Math. Structures Comput. Sci. 7 4 1997 329 358
44. Steffen J. van Bakel. Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems. PhD thesis, Catholic University of Nijmegen, 1993
45. Steffen J. van Bakel Principal type schemes for the strict type assignment system J. Logic Comput. 3 6 December 1993 643 670
46. J.B. Wells The essence of principal typings Proc. 29th Int'l Coll. Automata, Languages, and Programming LNCS volume 2380 2002 Springer-Verlag 913 925