Dependent types with subtyping and late-bound overloading

Information and Computation

Volumn 168, Issue 1, 2001, Pages 1-67

  Castagna, Giuseppe ^a   Chen, Gang ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (STANDARDS); COMPUTABILITY AND DECIDABILITY; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS;

SUBTYPING;

OBJECT ORIENTED PROGRAMMING;

EID: 0035838826     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3128     Document Type: Article

References (39)

1. [AC96a] M.-V. Aponte and G. Castagna (1996), Programmation modulaire avec surcharge et liaison tardive, in "Journées Francophones des Langages Applicatifs," Val Morin, Québec, Canada. [In French]
2. [AC96b], D. Aspinall and A. Compagnoni (1996), Subtyping dependent types, in "Proc. 11th Annual Synposium on Logic in Computer Science," pp. 86-97, IEEE, New York.
3. [Asp95] D. Aspinall (1995), Subtyping with singleton types, in "Proc. Computer Science Logic. CSL'94," Lecture Notes in Computer Science, Vol. 933, Springer-Verlag, Berlin/New York.
4. [Bar84] H. P. Barendregt (1984), "The Lambda Calculus Its Syntax and Semantics," revised ed., North-Holland, Amsterdam.
5. [Bar92] H. Barendregt (1992), Lambda calculi with types, in "Handbook of Logic in Computer Science," Vol. 2, Clarendon Press, Oxford.
6. [BCDC83] H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini (1983), A filter lambda model and the completeness of type assignment, J. Symbolic Logic 48, 931-940.
7. [CAB'86] R. L. Constable, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, D. J. Howe, T. B. Knoblock, N. P. Mender, P. Panangaden, J. T. Sasaki, and S. F. Smith (1986), "Implementing Mathematics in the NuPRL Proof Development System," Prentice-Hall, Englewood Cliffs, NJ.
8. [Car88] L. Cardelli (1988), A semantics of multiple inheritance, Inform. and Comput. 76, 138-164. A previous version can be found in Semantics of Data Types, Lecture Notes in Computer Science, Vol. 173, pp. 51-67. Springer-Verlag, Berlin/New York.
9. [Cas95] G. Castagna (1995), Covariance and contravariance: conflict without a cause, ACM Trans. Programming Languages Systems 17, 431-447.
10. [Cas96] G. Castagna (1996), Integration of parametric and "ad hoc" second order polymorphism in a calculus with subtyping, Formal Aspects Comput. 8, 247-293.
11. [Cas97] G. Castagna (1997), Object-oriented programming: A unified foundation, in "Progress in Theoretical Computer Science," Birkäuser, Boston.
12. [CD80] M. Coppo and M. Dezani-Ciancaglini (1980), An extension of the basic functionality theory for the λ-calculus, Notre-Dame J. Formal Logic 21, 685-693.
13. [CG97] A. Compagnoni and H. Goguen (1997), "Typed Operational Semantics for Higher Order Subtyping," Technical Report ECS-LFCS-97-361. LFCS University of Edinburgh.
14. [CGL93] G. Castagna, G. Ghelli, and G. Longo (1993), A semantics for λ&-early: a calculus with overloading and early binding, in "International Conference on Typed Lambda Calculi and Applications, (M. Bezem and J. F. Groote, Eds.), Utrecht, The Netherlands, March 1993," Lecture Notes in Computer Science Vol. 664, pp. 107-123, Springer-Verlag, Berlin/New York.
15. [CGL95] G. Castagna, G. Ghelli, and G. Longo (1995), A calculus for overloaded functions with subtyping, Inform. and Comput. 117, 115-135.
16. [Cha92] C. Chambers (1992), Object-oriented multi-methods in Cecil, in "ECOOP'92," Lecture Notes in Computer Science, Vol. 615, Springer-Verlag, Berlin/New York.
17. [Che96] G. Chen (1996), "Dependent Type System with Subtyping," Technical Report LIENS-96-27. Laboratoire d'Informatique. Ecole Normale Supérieure, Paris, December 1996.
18. [Che97] G. Chen (1997), Subtyping calculus of construction, extended abstract, in "22nd International Symposium on Mathematical Foundation of Computer Science," Lecture Notes in Computer Science, Vol: 1295, Springer-Verlag, Berlin/New York.
19. [Che98] G. Chen (1998), "Subtyping, Type Conversions and Elimnation of Transitivity," Ph.D. thesis, Université Paris 7, December.
20. [Coq92] I. Coquand (1992), Pattern matching with dependent types, in "Proceedings on Types for Proofs and Programs," pp. 71-83.
21. [Cou97] J. Courant (1997), A module calculus for pure type systems, in "Typed Lambda Calculus and Applications," Lecture Notes in Computer Science, Vol. 1210, pp. 112-128.
22. [DG87] I. G. DeMichiel and R. P. Gabriel (1987), Common lisp object system overview, in "Proc. of ECOOP '87 European Conference on Object-Oriented Programming, Paris, France, June 1987" Lecture Notes in Computer Science Vol. 276, pp. 151-170, Springer-Verlag, Berlin/New York.
23. [Ghe93] G. Ghelli (1993), Recursive types are not conservative over F, in (M. Bezem and J. F. Groote, Eds.), "International Conference of typed Lambda Calculi and Applications, Utrecht, The Netherlands, March 1993" Lecture Notes in Computer Science, Vol. 664, pp. 146-162, Springer-Verlag, Berlin/New York.
24. [Gir87] J. Y. Girard (1987), Linear logic, in "Theoretical Computer Science," Vol. 50, pp. 1-102, North-Holland; Amsterdam.
25. [HHP93] R. Harper, F. Honsell, and G. Plotkin (1993), A framework for defining logics, J. Assoc. Comput. Mach. 40, 143-184.
26. [Hic95] J. J. Hickey (1995), "Formal Abstract Data Types," Unpublished draft, December.
27. [Hin64] R. Hindley (1964), "The Church-Rosser Property and a Result of Combinatory Logic," Dissertation, University of Newcastle-upon-Tyne.
28. [HL94] R. Harper and M. Lillibridge (1994), A type-theoretic approach to higher-order modules with sharing, in "21st Annual Symposium on Principles Of Programming Languages, Portland, Oregon," pp. 123-137, Assoc. Comput. Mach. Press, New York.
29. [Ler94] X. Leroy (1994), Manifest types, Modules, and separate compilation, in "Proceedings of the 21st Symposium on Principles of Programming Languages," pp. 109-122, ACM Press, New York.
30. [Luo96] Z. Luo (1996), 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, Vol. 1258, Springer-Verlag, Berlin/New York.
31. [Luo97] Z. Luo (1997), Coercive subtyping, J. Logic Comput. 9(13).
32. [MH88] J. C. Mitchell and R. Harper (1988), The essence of ML, in "15th Ann. ACM Symp. on Principles of Programming Languages."
33. [MQ85] D. B. Mac Queen (1985), Modules for standard ML, Polymorphism 2(2).
34. [MQ86] D. B. Mac Queen (1986), Using dependent types to express modular structure: experience with Pebble and ML, in "Proc. 13th Annual ACM Symp. on Principles of Programming Languages."
35. [MTH90] R. Milner, M. Tofte, and R. Harper, "The Definition of Standard ML," The MIT Press, Cambridge, MA, 1990.
36. [Pfe93] F. Pfenning (1993), Refinement types for logical frameworks, in "Informal Proceedings of the 1993 Workshop on Types for Proof and Programs."
37. [Ros73] B. K. Rosen (1973), Tree manipulation systems and Church-Rosser theorems, Journal of ACM 20, 160-187.
38. [Tai67] W. W. Tait (1967), Intensional interpretation of functional of finite type I, J. Symbolic Logic 32, 198-212.
39. [Zwa99] J. Zwanenburg (1999), Pure type systems with subtyping, in "TLCA'99," Lecture Notes in Computer Science, Vol. 1581, Springer-Verlag, Berlin/New York.