Advertisement

A theory of qualified types

  • Mark P. Jones
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 582)

Keywords

Type System Type Scheme Qualified Type Type Expression Typing Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [BCGS89]
    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.Google Scholar
  2. [Blo90]
    Stephen Blott. An approach to overloading with polymorphism. Ph.D. thesis, Department of computing science, University of Glasgow, 1990 (in preparation).Google Scholar
  3. [BW89]
    Richard Bird and Philip Wadler. Introduction to functional programming. Prentice Hall International, 1989.Google Scholar
  4. [CDK86]
    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.Google Scholar
  5. [CM90]
    Luca Cardelli 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.Google Scholar
  6. [Dam85]
    Luis Damas. Type assignment in programming languages. PhD thesis, University of Edinburgh, CST-33-85, 1985.Google Scholar
  7. [DM82]
    Luis Damas 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.Google Scholar
  8. [FM89]
    You-Chin Fuh and Prateek Mishra. Polymorphic subtype inference: Closing the theory-practice gap. Lecture notes in computer science 352, Springer Verlag, 1990.Google Scholar
  9. [HP90]
    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.Google Scholar
  10. [HPJW91]
    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.Google Scholar
  11. [Jon91a]
    Mark P. Jones. Towards a theory of qualified types. Technical report PRG-TR-6-91, Programming Research Group, Oxford University Computing Laboratory, April 1991.Google Scholar
  12. [Jon91b]
    Mark P. Jones. Type inference for qualified types. Technical report PRG-TR-10-91, Programming Research Group, Oxford University Computing Laboratory, June 1991.Google Scholar
  13. [Jon92]
    Mark P. Jones Practical issues in the implementation of qualified types. Forthcoming technical report, Oxford University Computing Laboratory, 1992.Google Scholar
  14. [Mil78]
    Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17, 3, 1978.Google Scholar
  15. [Mit84]
    John C. Mitchell. Coercion and type inference (summary). Proceedings of the 11th annual ACM symposium on Principles of Programming Languages, 1984.Google Scholar
  16. [Mit90]
    John C. Mitchell A type-inference approach to reduction properties and semantics of polymorphic expressions. Logical Foundations of Functional Programming, Gérard Huet (ed.), Addison Wesley, 1990.Google Scholar
  17. [PJW90]
    Simon L. Peyton Jones and Philip Wadler A static semantics for haskell (draft). Department of Computing Science, University of Glasgow, August 1990.Google Scholar
  18. [Rem89]
    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.Google Scholar
  19. [Rob65]
    J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the Association for Computing Machinery, 12, 1965.Google Scholar
  20. [Smi91]
    Geoffrey Smith. Polymorphic type inference for languages with overloading and subtyping. Ph.D. thesis, Department of Computer Science, Cornell University, August 1991.Google Scholar
  21. [VS91]
    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.Google Scholar
  22. [WB89]
    Philip Wadler 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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Mark P. Jones
    • 1
  1. 1.Programming Research GroupOxford University Computing LaboratoryOxford

Personalised recommendations