Pure type systems with subtyping

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

Volumn 1581, Issue , 1999, Pages 381-396

  Zwanenburg, Jan ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTER PROGRAMMING LANGUAGES; PATHOLOGY;

DESIGN DECISIONS; EXISTING SYSTEMS; META-THEORY; PURE TYPE SYSTEMS; SUBJECT REDUCTION; SUBTYPINGS; TYPING RULES;

FORMAL LANGUAGES;

EID: 84949221822     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48959-2_27     Document Type: Conference Paper

References (15)

1. David Aspinall and Adriana Compagnoni. Subtyping dependent types. In 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, 1996.
2. H. Barendregt. Lambda calculi with types. In S. Abramsky, D. M. Gabbai, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2. Oxford University Press, 1992.
3. Gilles Barthe. Implicit coercions in type systems. In Proceedings of the International Workshop Types '95, Torino, Italy, volume 1158 of Lecture Notes in Computer Science, 1996.
4. Luca Cardelli. A semantics of multiple inheritance. Information and Computation, 176:138-164, 1988.
5. Pierre-Louis Curien and Giorgio Ghelli. Coherence of subsumption, minimum typing and the type checking in F. Mathematical Structures in ComputerScience, 2 (1):55-91, 1992.
6. Adriana Compagnoni and Healfdene Goguen. Typed operational semantics for higher order subtyping. Technical Report ECS-LFCS-97-361, University of Edinburgh, 1997.
7. Thierry Coquand and Gerard P. Huet. The calculus of constructions. Information and Computation, 76:95-120, 1988.
8. Gang Chen. Subtyping calculus of construction. In Mathematical Foundations of Computer Science (MFCS’97), Bratislava, Slovakia, volume 1295, pages 189-198. Springer-Verlag, August 1997.
9. Adriana B. Compagnoni. Higher-Order Subtyping with Intersection Types. PhD thesis, University of Nijmegen, The Netherlands, 1995.
10. Giuseppe Castagna and Benjamin C. Pierce. Decidable bounded quantification. In Proceedings of the 21st ACM Symposium on Principles of Programming Languages (POPL), Portland, Oregon. ACM, 1994.
11. Luca Cardelli and Peter Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys, 17 (4):471-522, 1985.
12. Zhaohui Luo. ECC: an Extended Calculus of Constructions. In Proceedings of IEEE 4th Annual Symposium on Logic in Computer Science (LICS’89), Asilomar, California, 1989.
13. Benjamin C. Pierce. Bounded quantification is undecidable. Information and Computation, 112 (1):131-165, 1994.
14. Benjamin Pierce and Martin Steffen. Higher-order subtyping. In IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET), 1994.
15. Jan Zwanenburg. An Object Oriented Programming Logic Based on Type Theory. PhD thesis, Eindhoven University of Technology, 1999. To appear.