Branching types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2305, Issue , 2002, Pages 115-132

  Wells, Joe B ^a   Haack, Christian ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

INTERSECTION TYPES;

ARTIFICIAL INTELLIGENCE;

EID: 84872477948     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45927-8_9     Document Type: Conference Paper

References (26)

1. T. Amtoft, F. Turbak. Faithful translations between polyvariant flows and polymorphic types. In Programming Languages & Systems, 9th European Symp. Programming, vol. 1782 of LNCS, pp. 26–40. Springer-Verlag, 2000.
2. B. Capitani, M. Loreti, B. Venneri. Hyperformulae, parallel deductions and intersection types. Electronic Notes in Theoretical Computer Science, 50, 2001. Proceedings of ICALP 2001 workshop: Bohm’s Theorem: Applications to Computer Science Theory (BOTH 2001), Crete, Greece, 2001-07-13.
3. M. Coppo, M. Dezani-Ciancaglini. An extension of the basic functionality theory for the ?-calculus. Notre Dame J. Formal Logic, 21(4):685–693, 1980.
4. M. Dezani-Ciancaglini, S. Ghilezan, B. Venneri. The “relevance” of intersection and union types. Notre Dame J. Formal Logic, 38(2):246–269, Spring 1997.
5. A. Dimock, R. Muller, F. Turbak, J. B. Wells. Strongly typed flow-directed representation transformations. In Proc. 1997 Int’l Conf. Functional Programming, pp. 11–24. ACM Press, 1997.
6. A. Dimock, I. Westmacott, R. Muller, F. Turbak, J. B. Wells. Functioning without closure: Type-safe customized function representations for Standard ML. In Proc. 2001 Int’l Conf. Functional Programming, pp. 14–25. ACM Press, 2001.
7. A. Dimock, I. Westmacott, R. Muller, F. Turbak, J. B. Wells, J. Considine. Program representation size in an intermediate language with intersection and union types. In Proceedings of the Third Workshop on Types in Compilation (TIC 2000), vol. 2071 of LNCS, pp. 27–52. Springer-Verlag, 2001.
8. J. Y. Girard. Interpretation Fonctionnelle et Elimination des Coupures de l’Arithmetique d’Ordre Superieur. These d’Etat, Universite de Paris VII, 1972.
9. A. 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).
10. A. J. Kfoury, H. G. Mairson, F. A. Turbak, J. B. Wells. Relating typability and expressibility in finite-rank intersection type systems. In Proc. 1999 Int’l Conf. Functional Programming, pp. 90–101. ACM Press, 1999.
11. A. J. Kfoury, J. B. Wells. A direct algorithm for type inference in the rank-2 fragment of the second-order ?-calculus. In Proc. 1994 ACM Conf. LISP Funct. Program., pp. 196–207, 1994.
12. 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.
13. J. Palsberg, C. Pavlopoulou. From polyvariant flow information to intersection and union types. J. Funct. Programming, 11(3):263–317, May 2001.
14. B. C. Pierce. Programming with intersection types, union types, and polymorphism. Technical Report CMU-CS-91-106, Carnegie Mellon University, Feb. 1991.
15. G. Pottinger. A type assignment for the strongly normalizable ?-terms. In J. R. Hindley, J. P. Seldin, eds., To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, pp. 561–577. Academic Press, 1980.
16. J. C. Reynolds. Towards a theory of type structure. In Colloque sur la Programmation, vol. 19 of LNCS, pp. 408–425, Paris, France, 1974. Springer-Verlag.
17. J. C. Reynolds. Design of the programming language Forsythe. In P. O’Hearn, R. D. Tennent, eds., Algol-like Languages. Birkhauser, 1996.
18. S. Ronchi Della Rocca, L. Roversi. Intersection logic. In Computer Science Logic, CSL’01. Springer-Verlag, 2001.
19. F. Turbak, A. Dimock, R. Muller, J. B. Wells. Compiling with polymorphic and polyvariant flow types. In Proc. First Int’l Workshop on Types in Compilation, June 1997.
20. P. Urzyczyn. Type reconstruction in F?. Math. Structures Comput. Sci., 7(4):329– 358, 1997.
21. B. Venneri. Intersection types as logical formulae. J. Logic Comput., 4(2):109–124, Apr. 1994.
22. J. B. Wells. Typability and type checking in the second-order ?-calculus are equivalent and undecidable. In Proc. 9th Ann. IEEE Symp. Logic in Comp. Sci., pp. 176–185, 1994. Superseded by [24].
23. J. B. Wells. Typability is undecidable for F+eta. Tech. Rep. 96-022, Comp. Sci. Dept., Boston Univ., Mar. 1996.
24. J. B. Wells. Typability and type checking in System F are equivalent and undecidable. Ann. Pure Appl. Logic, 98(1–3):111–156, 1999. Supersedes [22].
25. J. B. Wells, A. Dimock, R. Muller, F. Turbak. A typed intermediate language for flow-directed compilation. In Proc. 7th Int’l Joint Conf. Theory & Practice of Software Development, pp. 757–771, 1997. Superseded by [26].
26. J. B. Wells, A. Dimock, R. Muller, F. Turbak. A calculus with polymorphic and polyvariant flow types. J. Funct. Programming, 2000. To appear. Supersedes [25].