Anti-symmetry of higher-order subtyping

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

Volumn 1683, Issue , 1999, Pages 420-438

  Compagnoni, Adriana ^a,b   Goguen, Healfdene ^a,b  

^a STEVENS INSTITUTE OF TECHNOLOGY   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); FORMAL LANGUAGES; SEMANTICS;

ANTI-SYMMETRIC; DERIVED PROPERTIES; HIGHER-ORDER; LAMBDA CALCULUS; OPERATIONAL SEMANTICS; PARTIAL ORDER; SUBTYPING RELATION; SUBTYPINGS;

COMPUTER CIRCUITS;

EID: 11444252017     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_30     Document Type: Conference Paper

References (35)

1. M. Abadi and L. Cardelli. A Theory of Objects. Springer-Verlag, 1996.
2. R. M. Amadio and L. Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575-631, 1993.
3. D. Aspinall and A. Compagnoni. Subtyping dependent types. In Eleventh Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, July 1996. Long version to appear in Theoretical Computer Science.
4. H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic, 48(4):931-940, 1983.
5. V. Breazu-Tannen, T. Coquand, C. Gunter, and A. Scedrov. Inheritance as implicit coercion. Information and Computation, 93:172-221, 1991.
6. K. B. Bruce. Typing in object-oriented languages: Achieving expressiveness and safety. Unpublished, June 1996.
7. K. B. Bruce and G. Longo. A modest model of records, inheritance, and bounded quantification. Information and Computation, 87:196-240, 1990.
8. L. Cardelli. A semantics of multiple inheritance. Information and Computation, 76:138-164, 1988.
9. ≤:. Unpublished manuscript, Oct. 1990.
10. L. Cardelli and G. Longo. A semantic basis for Quest. Journal of Functional Programming, 1(4):417-458, Oct. 1991.
11. L. Cardelli and J. Mitchell. Operations on records. Mathematical Structures in Computer Science, 1:3-48, 1991. Also in [23], and available as DEC Systems Research Center Research Report #48, August, 1989, and in the proceedings of MFPS’89, Springer LNCS volume 442.
12. L. Cardelli and P. Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys, 17(4), Dec. 1985.
13. J. Chroboczek. Game Semantics and Subtyping. PhD thesis, University of Edinburgh, 1999. Forthcoming Thesis. Supervisor: Prof. S. Abramsky.
14. A. Compagnoni and H. Goguen. Decidability of higher-order subtyping via logical relations, Dec. 1997.
15. A. Compagnoni and H. Goguen. Typed operational semantics for higher order subtyping. Technical Report ECS-LFCS-97-361, University of Edinburgh, July 1997. ubmitted to Information and Computation.
16. A. B. Compagnoni. Higher-Order Subtyping with Intersection Types. PhD thesis, University of Nijmegen, The Netherlands, Jan 1995. Supervisor: Prof. Barendregt. ISBN 90-9007860-6.
17. A. B. Compagnoni and B. C. Pierce. Higher-order intersection types and multiple inheritance. Mathematical Structures in Computer Science, 6:469-501, 1996.
18. M. Coppo and M. Dezani-Ciancaglini. A new type-assignment for λ-terms. Archiv. Math. Logik, 19:139-156, 1978.
19. ≤. In T. Ito and A. R. Meyer, editors, Theoretical Aspects of Computer Software (Sendai, Japan), number 526 in Lecture Notes in Computer Science, pages 731-749. Springer-Verlag, Sept. 1991.
20. ≤. Mathematical Structures in Computer Science, 2:55-91, 1992.
21. D. Duggan and A. Compagnoni. Subtyping for object type constructors. In Foundations of Object-Oriented Languages (FOOL 6). http://www.cs.williams.edu/˜kim/FOOL/sched6.html, 1999.
22. H. Goguen. Typed operational semantics. In Proceedings of the International Conference on Typed Lambda Calculi and Applications, volume 902 of Lecture Notes in Computer Science, pages 186-200. Springer-Verlag, Apr. 1995.
23. C. A. Gunter and J. C. Mitchell. Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design. The MIT Press, 1994.
24. M. Hofmann and B. Pierce. Positive subtyping. Information and Computation, 126(1), 1996.
25. A. Jones, Z. Luo, and S. Soloviev. Some algorithmic and proof-theoretical aspects of coercive subtyping. In Proceedings of TYPES’96, Lecture Notes in Computer Science, 1996.
26. P. Martin-Löf. Intuitionistic Type Theory. Bibliopolis, 1984.
27. J. C. Mitchell. Toward a typed foundation for method specialization and inheritance. In Proceedings of the 17th ACM Symposium on Principles of Programming Languages, pages 109-124, Jan. 1990.
28. J. C. Mitchell, F. Honsell, and K. Fisher. A lambda calculus of objects and method specialization. In 1993 IEEE Symposium on Logic in Computer Science, June 1993.
29. F. Pfenning. Refinement types for logical frameworks. In Informal Proceedings of the 1993 Workshop on Types for Proofs and Programs, pages 315-328, May 1993.
30. B. Pierce and M. Steffen. Higher-order subtyping. Theoretical Computer Science, 176(1-2) 235-282, 1997. corrigendum in TCS vol. 184 (1997), p. 247.
31. B. C. Pierce. Bounded quantification is undecidable. Information and Computation, 1993.
32. B. C. Pierce. Bounded quantification with bottom. Technical Report 492, Computer Science Department, Indiana University, 1997.
33. M. Steffen. Polarized Higher-Order Subtyping. PhD thesis, Lehrstuhl für Informatik VII, Friedrich Alexander Universität Erlangen-Nürnberg, 1998.
34. J. Tiuryn. Equational axiomatization of bicoercibility for polymorphic types. In Proceedings of FST-TCS’95, 1995. 436 A. Compagnoni and H. Goguen
35. J. Zwanenburg. An Object Oriented Programming Logic Based on Type Theory. PhD thesis, Eindhoven University of Technology, 1999. Supervisor: Prof. Hemerik.