Coherence and transitivity of subtyping as entailment

Journal of Logic and Computation

Volumn 10, Issue 4, 2000, Pages 493-526

  Longo, Giuseppe ^a   Milsted, Kathleen ^b   Soloviev, Sergei ^c  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b ORANGE LABS   (France)

^c UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES; FUNCTIONS; LOGIC PROGRAMMING; OBJECT ORIENTED PROGRAMMING;

COERCIVE SUBTYPING; GENTZEN SEQUENT CALCULUS; POLYMORPHISM; SECOND ORDER LOGIC;

FORMAL LOGIC;

EID: 0034251402     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/10.4.493     Document Type: Article

References (35)

1. M. Abadi, L. Cardelli and P.-L. Curien. Formal parametric polymorphism, Theoretical Computer Science, 121, 9-58, 1993.
2. V. Breazu-Tannen, T. Coquand, C. Gunter and A. Scedrov. Inheritance as implicit coercion, Information and Computation, 93, 172-221, 1991.
3. K. Bruce, R. Di Cosmo and G. Longo. Provable isomorphisms of types, Mathematical Structures in Computer Science, 2, 231-247, 1992.
4. K. Bruce and G. Longo. A modest model of records, inheritance, and bounded quantification, Information and Computation, 87, 196-240, 1990.
5. U. Berger and H. Schwichtenberg. An inverse of the evaluation functional for typed λ-calculus. In Proceedings of the 6th IEEE Symposium on Logic in Computer Science (LICS), pp. 203-213, IEEE Computer Society Press, 1991.
6. ≤, Mathematical Structures in Computer Science, 2, 55-92, 1992.
7. L. Cardelli and G. Longo. A semantic basis for Quest, Journal of Functional Programming, 1, 417-458, 1991.
8. L. Cardelli, S. Martini, J. Mitchell and A. Scedrov. An extension of system F with subtyping, Information and Computation, 94, 4-56, 1994. First appeared in Proceedings of the Conference on Theoretical Aspects of Computer Software, (Sendai, Japan), T. Ito and R. Meyer, eds., pp. 750-770, Lecture Notes in Computer Science 526, Springer, 1991.
9. L. Cardelli, S. Martini, J. Mitchell and A. Scedrov. An extension of system F with subtyping, Information and Computation, 94, 4-56, 1994. First appeared in Proceedings of the Conference on Theoretical Aspects of Computer Software, (Sendai, Japan), T. Ito and R. Meyer, eds., pp. 750-770, Lecture Notes in Computer Science 526, Springer, 1991.
10. L. Cardelli and P. Wegner. On understanding types, data abstraction, and polymorphism, ACM Computing Surveys, 17, 471-522, 1985.
11. G. Chen. Dependent type system with subtyping. Technical Report LIENS-96-27, Ecole Normale Supérieure, Paris. Revised version to appear in Journal of Computer Science and Technology.
12. G. Chen. Dependent type system with subtyping. Technical Report LIENS-96-27, Ecole Normale Supérieure, Paris. Revised version to appear in Journal of Computer Science and Technology.
13. G. Chen. Sous-typage, conversion de types et élimination de la transitivité. Doctoral thesis, Laboratoire d'Informatique de l'Ecole Normale Supérieure, Paris. December 1998.
14. J.-Y. Girard. Une extension de l'interprétation de Gödel à l'analyse, et son application à l'élimination des coupures dans l'analyse et la théorie des types. Proceedings of the 2nd Scandinavian Logic Symposium, J.E. Fenstad, ed., pp. 63-92, North-Holland, 1971.
15. J.-Y. Girard, Y. Lafont and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science 7, Cambridge University Press, 1989.
16. J. Hyland. The effective topos. In Proceedings of The L. E. J. Brouwer Centenary Symposium, A.S. Troelstra and D.S. van Dalen, eds., pp. 165-216, North-Holland, 1982.
17. J. Hyland. A small complete category, Annals of Pure and Applied Logic, 40, 135-165, 1988.
18. A. Jones, Z. Luo and S. Soloviev. Some algorithmic and proof-theoretical aspects of coercive subtyping. Selected papers of the International TYPES'96 Workshop (Aussois, France, December 1996), E. Giménez and C. Paulin-Mohring, eds., Lecture Notes in Computer Science 1512, pp. 173-196, Springer, 1998.
19. S. Kleene. Mathematical Logic, Wiley, 1967.
20. G. Longo and E. Moggi. Constructive natural deduction and its ω-set interpretation. Mathematical Structures in Computer Science 1:2, pages 215-253, 1991.
21. G. Longo, K. Milsted, and S. Soloviev. The genericity theorem and the notion of parametricity in the polymorphic λ-calculus, Theoretical Computer Science, 121, 323-349, 1993.
22. G. Longo, K. Milsted and S. Soloviev. A logic of subtyping (extended abstract). In Proceedings of the 10th IEEE Symposium on Logic in Computer Science (LICS), IEEE Computer Society Press, 1995.
23. G. Longo, K. Milsted and S. Soloviev. A logic of subtyping. Complete version of the previous paper; available by anonymous ftp from ftp.ens.fr as /pub/dmi/users/longo/logicSubtyping.ps.Z or ... /logicSubtyping.dvi.Z
24. Zhaohui Luo. Coercive subtyping in type theory. In CSL'96, the 1996 Annual Conference of the European Association for Computer Science Logic, Utrecht, Lecture Notes in Computer Science, v. 1258, 1996.
25. Q. Ma and J. Reynolds. Types, abstraction, and parametric polymorphism, part 2. In Proceedings of the Conference on Mathematical Foundations of Programming Semantics, S. Brookes, M. Main, A. Melton, M. Mislove, and D. Schmidt, eds., pp. 1-40. Lecture Notes in Computer Science 598, Springer, 1992.
26. J. Mitchell. Polymorphic type inference and containment, Information and Computation, 76, 211-249, 1988. Also appeared in Logical Foundations of Functional Programming, G. Huet, ed., pp. 153-193, Addison-Wesley, 1990.
27. J. Mitchell. Polymorphic type inference and containment, Information and Computation, 76, 211-249, 1988. Also appeared in Logical Foundations of Functional Programming, G. Huet, ed., pp. 153-193, Addison-Wesley, 1990.
28. B. Pierce and M. Steffen. Higher-order subtyping, Theoretical Computer Science, 176, 235-282, 1997. A preliminary version appeared in Proceedings of the IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET), June 1994, and as University of Edinburgh technical report ECS-LFCS-94-280 and Universität Erlangen-Nürnberg Interner Bericht IMMD7-01/94, January 1994.
29. B. Pierce and M. Steffen. Higher-order subtyping, Theoretical Computer Science, 176, 235-282, 1997. A preliminary version appeared in Proceedings of the IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET), June 1994, and as University of Edinburgh technical report ECS-LFCS-94-280 and Universität Erlangen-Nürnberg Interner Bericht IMMD7-01/94, January 1994.
30. A. Pitts. Non-trivial power types can't be subtypes of polymorphic types. In Proceedings of the 4th IEEE Symposium on Logic in Computer Science (LICS), pp. 6-13, IEEE Computer Society Press, 1989.
31. J. Reynolds. Polymorphism is not set-theoretic. Proceedings of Semantics of Data Types, G. Kahn et al., eds., pp. 145-156. Lecture Notes in Computer Science 173, Springer, 1984.
32. S. Soloviev. The category of finite sets and Cartesian closed categories, Journal of Soviet Mathematics, 22, 1387-1400, 1983.
33. J. Tiuryn. Equational axiomatization of bicoercibility for polymorphic types. In Proceedings of the 15th Conference on the Foundations of Software Technology and Theoretical Computer Science, P. S. Thiagarajan, ed., pp. 166-179. Lecture Notes in Computer Science 1026, Springer, 1995.
34. J. Tiuryn. A sequent calculus for subtyping polymorphic types. In Proceedings of the Conference on Mathematical Foundations of Computer Science, Springer, 1996.
35. J. Tiuryn and P. Urzyczyn. The subtyping problem for second-order types is undecidable. In Proceedings of the 11th IEEE Symposium on Logic in Computer Science (LICS), IEEE Computer Society Press, 1996.