Constructor subtyping

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

Volumn 1576, Issue , 1999, Pages 109-127

  Barthe, Gilles ^a,b   Frade, Maria João ^a  

^a UNIVERSITY OF MINHO   (Portugal)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957873890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49099-X_8     Document Type: Conference Paper

References (33)

1. M. Abadi and L. Cardelli. A theory of objects. Springer-Verlag, 1996.
2. H. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, revised edition, 1984.
3. H. Barendregt. The impact of the lambda calculus in logic and computer science. Bulletin of Symbolic Logic, 3(2):181-215, June 1997.
4. B. Barras, et al. The Coq Proof Assistant User's Guide. Version 6.2, May 1998.
5. G. Barthe. Order-sorted inductive types. Information and Computation, 199x. To appear.
6. G. Barthe and M.J. Frade. Constructor subtyping. Technical Report UMDITR9807, Department of Computer Science, University of Minho, 1998.
7. G. Betarte. Dependent Record Types and Algebraic Structures in Type Theory. PhD thesis, Department of Computer Science, Chalmers Tekniska Högskola, 1998.
8. L. Cardelli. Type systems. ACM Computing Surveys, 28(1):263-264, March 1996.
9. L. Cardelli and P. Wegner. On understanding types, data abstraction and polymorphism. ACM Computing Surveys, 17(4):471-522, December 1985.
10. G. Castagna, G. Ghelli, and G. Longo. A calculus for overloaded functions with subtyping. Information and Computation, 117(1):115-135, February 1995.
11. A. Compagnoni and H. Goguen. Typed operational semantics for higher order subtyping. Technical Report ECS-LFCS-97-361, University of Edinburgh, July 1997.
12. T. Coquand. Pattern matching with dependent types. In B. Nordström, editor, Informal proceedings of Logical Frameworks'92, pages 66-79, 1992.
13. R. Di Cosmo. A brief history of rewriting with extensionality. Presented at the International Summer School on Type Theory and Term Rewriting, Glasgow, September 1996.
14. R. Di Cosmo and D. Kesner. Simulating expansions without expansions. Mathe- matical Structures in Computer Science, 4(3):315-362, September 1994.
15. E. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of theoretical computer science, volume B, pages 995-1072. Elsevier Publishing, 1990.
16. N. Ghani. Adjoint rewriting. PhD thesis, Laboratory for the Foundations of Computer Science, University of Edinburgh, 1995.
17. E. Giménez. Structural recursive definitions in Type Theory. In K.G. Larsen, S. Skyum, and G. Winskel, editors, Proceedings of ICALP'98, volume 1443 of Lecture Notes in Computer Science, pages 397-408. Springer-Verlag, 1998.
18. J. Goguen and R. Diaconescu. An Oxford survey of order sorted algebra. Mathematical Structures in Computer Science, 4(3):363-392, September 1994.
19. H. Hosoya, B. Pierce, and D.N. Turner. Subject reduction fails in Java. Message to the TYPES mailing list, 1998.
20. C.B. Jay and N. Ghani. The virtues of eta-expansion. Journal of Functional Programming, 5(2):135-154, April 1995.
21. M.P. Jones. Dictionary-free overloading by partial evaluation. In Proceedings of PEPM'94, pages 107-117, 1994. University of Melbourne, Australia, Department of Computer Science, Technical Report 94/9.
22. G. Kahn. Natural semantics. In Proceedings of the Symposium on Theoretical Aspects of Computer Science, volume 247 of Lecture Notes in Computer Science, pages 22-39. Springer-Verlag, 1987.
23. J.-J. Lévy. An algebraic interpretation of the λβκ-calculus and a labelled λ- calculus. Theoretical Computer Science, 2:97-114, 1976.
24. Z. Luo. Coercive subtyping. Journal of Logic and Computation, 199x. To appear.
25. S. Marlow and P. Wadler. A practical subtyping system for Erlang. In Proceedings of ICFP'97, pages 136-149. ACM Press, 1997.
26. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, 1997.
27. J. C. Mitchell, M. Hoang, and B. T. Howard. Labelling techniques and typed fixedpoint operators. In A.D. Gordon and A.M. Pitts, editors, Higher Order Operational Techniques in Semantics, pages 137-174. Cambridge University Press, 1998.
28. J. Peterson and K. Hammond (editors). Haskell 1.4.: A Non-strict, Purely Functional Language, April 1997.
29. F. Pfenning. Refinement types for logical frameworks. In H. Geuvers, editor, Informal Proceedings of TYPES'93, pages 285-299, 1993.
30. B.C. Pierce and D.N. Turner. Local type inference. In Proceedings of POPL'98, pages 252-265. ACM Press, 1998.
31. F. Pottier. Synthèse de types en présence de sous-typage: de la théorie la pratique. PhD thesis, Université Paris VII, 1998.
32. N. Shankar, S. Owre, and J.M. Rushby. The PVS Proof Checker: A Reference Manual. Computer Science Laboratory, SRI International, February 1993. Supplemented with the PVS2 Quick Reference Manual, 1997.
33. H. Xi and F. Pfenning. Dependent types in practical programming. In Proceedings of POPL' 99. ACM Press, 1999. To appear.