Bounded existentials and minimal typing

Theoretical Computer Science

Volumn 193, Issue 1-2, 1998, Pages 75-96

  Ghelli, Giorgio ^a   Pierce, Benjamin ^b,c  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038518160     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00300-3     Document Type: Article

References (14)

1. A. Albano, L. Cardelli and R. Orsini, Galileo: a strongly typed, interactive conceptual language, ACM Trans. Database Systems 10 (1985) 230-260.
2. ≤, Research Report 97, DEC Systems Research Center, February 1993.
3. L. Cardelli, S. Martini, J.C. Mitchell and A. Scedrov, An extension of system F with subtyping, Inform. and Comput. 109 (1994) 4-56. A preliminary version appeared in TACS'91 Sendai, Japan, pp. 750-770.
4. L. Cardelli, S. Martini, J.C. Mitchell and A. Scedrov, An extension of system F with subtyping, Inform. and Comput. 109 (1994) 4-56. A preliminary version appeared in TACS'91 Sendai, Japan, pp. 750-770.
5. L. Cardelli and P. Wegner, On understanding types, data abstraction, and polymorphism, Comput. Surveys 17(4) (1985).
6. ≤, Math. Struct. Comput. Sci. 2 (1992) 55-91. Also in: C.A. Gunter and J.C. Mitchell, ed., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (MIT Press, Cambridge, MA, 1994).
7. ≤, Math. Struct. Comput. Sci. 2 (1992) 55-91. Also in: C.A. Gunter and J.C. Mitchell, ed., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (MIT Press, Cambridge, MA, 1994).
8. ≤, in: M. Bezen and J.F. Groote, ed., Proc. Internat. Conf. on Typed Lambda Calculi and Applications (TLCA), Utrecht, The Netherlands, 146-162. Lecture Notes in Computer Science, Vol. 664 (Springer, Berlin, 1993).
9. G. Ghelli, Proof theoretic studies about a minimal type system intergrating inclusion and parametric polymorphism, Ph.D. Thesis, Università di Pisa, 1990. Tech. Report TD 6/90, Dipartimento di Informatica, Universita di Pisa.
10. ≤ type checking. Theoret. Comput. Sci. 139 (1995) 131-162.
11. J.Y. Girard, Interprétation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur, Ph.D. Thesis, Université Paris VII, 1972.
12. J. Mitchell and G. Plotkin, Abstract types have existential type, ACM Trans. Programming Languages and Systems 10 (1988).
13. B.C. Pierce, Bounded quantification is undecidable, Inform. and Comput. 112 (1994) 131-165. Also in C.A. Gunter and J.C. Mitchell, ed., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (MIT Press, Cambridge, MA, 1994). A preliminary version appeared in POPL'92.
14. B.C. Pierce, Bounded quantification is undecidable, Inform. and Comput. 112 (1994) 131-165. Also in C.A. Gunter and J.C. Mitchell, ed., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (MIT Press, Cambridge, MA, 1994). A preliminary version appeared in POPL'92.