A theory of qualified types

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

Volumn 582 LNCS, Issue , 1992, Pages 287-306

  Jones, Mark P ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84959656610     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55253-7_17     Document Type: Conference Paper

References (22)

1. V. Breazu-Tannen, T. Coquand, C. A. Gunter and A. Scedrov. Inheritance and coercion. Proceedings of the fourth annual symposium on logic in computer science, 1989.
2. Stephen Blott. An approach to overloading with polymorphism. Ph.D. thesis, Department of computing science, University of Glasgow, 1990 (in preparation).
3. Richard Bird and Philip Wadler. Introduction to functional programming. Prentice Hall International, 1989.
4. Dominique Clément, Joëlle Despeyroux, Thierry Despeyroux and Gilles Kahn. A simple applicative language: Mini-ML. ACM symposium on LISP and functional programming, 1986.
5. Luca CardeUi and John Mitchell. Operations on records. Proceedings of the Fifth International Conference on Mathematical Foundations of Programming Language Semantics. Lecture notes in computer science 442, Springer Verlag, 1990.
6. Luis Damns. Type assignment in programming languages. PhD thesis, University of Edinburgh, CST-33-85, 1985.
7. Luis Damns and Robin Milner. Principal type schemes for functional programs. Proceedings of the 8th annual ACM symposium on Principles of Programming languages, Albuquerque, New Mexico, January 1982.
8. You-Chin Fuh and Prateek Mishra. Polymorphic subtype inference: Closing the theorypractice gap. Lecture notes in computer science 352, Springer Verlag, 1990.
9. Robert W. Harper and Benjamin C. Pierce. Extensible records without subsumption. Technical report CMU-CS-90-102, Carnegie Mellon University, School of computer science, February 1990.
10. Paul Hudak, Simon Peyton Jones and Philip Wadler (editors). Report on the programming language Haskell, a non-strict purely functional language (Version 1.1). Technical Report YALEU/DCS/RR777, Yale University, Department of Computer Science, August 1991.
11. Mark P. Jones. Towards a theory of qualified types. Technical report PRG-TR-6-91, Programming Research Group, Oxford University Computing Laboratory, April 1991.
12. Mark P. Jones. Type inference for qualified types. Technical report PRG-TR-10-91, Programming Research Group, Oxford University Computing Laboratory, June 1991.
13. Mark P. Jones Practical issues in the implementation of qualified types. Forthcoming technical report, Oxford University Computing Laboratory, 1992.
14. Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17, 3, 1978.
15. John C. Mitchell. Coercion and type inference (summary). Proceedings of the llth annual ACM symposium on Principles of Programming Languages, 1984.
16. John C. Mitchell A type-inference approach to reduction properties and semantics of polymorphic expressions. Logical Foundations of Functional Programming, G6rard Huet (ed.), Addison Wesley, 1990.
17. Simon L. Peyton Jones and Philip Wadler A static semantics for haskell (draft). Department of Computing Science, University of Glasgow, August 1990.
18. Didier Rémy. Typechecking records and variants in a natural extension of ML. Proceedings of the 16th annual ACM symposium on Principles of Programming Languages, Austin, Texas, January 1989.
19. J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the Association for Computing Machinery, 12, 1965.
20. Geoffrey Smith. Polymorphic type inference for languages with overloading and subtyping. Ph.D. thesis, Department of Computer Science, Cornell University, August 1991.
21. Dennis Volpano and Geoffrey Smith. On the complexity of ML typability with overloading. Proceedings of the 5th ACM conference on Functional Programming Languages and Computer Architecture. Lecture notes in computer science 523, Springer Verlag, 1991.
22. Philip Waxiler and Stephen Blott. How to make ad-hoc polymorphism less ad-hoc. Proceedings of the 16th annual ACM symposium on Principles of Programming Languages, Austin, Texas, January 1989.