Type classes with existential types

Journal of Functional Programming

Volumn 6, Issue 3, 1996, Pages 485-517

  Läufer, Konstantin ^a  

^a LOYOLA UNIVERSITY CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042901812     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796800001817     Document Type: Article

References (34)

1. Augustsson, L. (1993a) Haskell B. user manual. Distributed with the HBC compiler.
2. Augustsson, L. (1993b) Implementing Haskell overloading. Proc. Functional Programming Languages and Computer Architecture. ACM.
3. Baumgartner, G. and Russo, V. (1994) Signatures: AC++ extension for type abstraction and subtype polymorphism. Software: Practice & Experience. To appear.
4. Blott, S. (1991) An Approach to Overloading with Polymorphism. PhD thesis, Department of Computing Science, University of Glasgow.
5. Cardelli, L. and Leroy, X. (1990) Abstract types and the dot notation. Proc. IFIP Working Conference on Programming Concepts and Methods, pp. 466-491, Sea of Galilee, Israel.
6. Cardelli, L. and Wegner, P. (1985) On understanding types, data abstraction and polymorphism. ACM Computing Surveys 17(4): 471-522.
7. Chen, K., Hudak, P. and Odersky, M. (1992) Parametric type classes. Proc. ACM Conf. Lisp and Functional Programming.
8. Damas, L. and Milner, R. (1982) Principal type schemes for functional programs. Proc. 9th ACM Symp. on Principles of Programming Languages, pp. 207-212.
9. Hall, C., Hammond, K., Peyton Jones, S. and Wadler, P. (1992) Type classes in Haskell. Technical report, Department of Computer Science, University of Glasgow.
10. Harper, R. and Lillibridge, M. (1994) A type-theoretic approach to higher-order modules with sharing. Proc. 21st ACM Symp. on Principles of Programming Languages, pp. 123-137.
11. Hudak, P., Peyton-Jones, S., Wadler, P., et al. (1992) Report on the programming language Haskell: A non-strict, purely functional language, Version 1.2. ACM SIGPLAN Notices, 27(5).
12. Jones, M. (1993a) Coherence for qualified types. Technical Report YALEU/DCS/RR-989, Department of Computer Science, Yale University.
13. Jones, M. (1993b) A system of constructor classes: Overloading and implicit higher-order polymorphism. Proc. Functional Programming Languages and Computer Architecture. ACM.
14. Kaes, S. (1988) Parametric overloading in polymorphic programming languages. In Ganzinger, H., editor, Proc. 2nd European Symposium on Programming, pp. 131-144, Nancy, France. Lecture Notes in Computer Science 300, Springer-Verlag.
15. Kaes, S. (1988) Parametric overloading in polymorphic programming languages. In Ganzinger, H., editor, Proc. 2nd European Symposium on Programming, pp. 131-144, Nancy, France. Lecture Notes in Computer Science 300, Springer-Verlag.
16. Läufer, K. (1992) Polymorphic type inference and abstract data types. PhD thesis, New York University. (Available as Technical Report 622, December 1992, from New York University, Department of Computer Science.)
17. Läufer, K. and Odersky, M. (1991) Type classes are signatures of abstract types. Proc. Phoenix Seminar and Workshop on Declarative Programming, pp. 148-162. Workshops in Computing series, Springer-Verlag.
18. Läufer, K. and Odersky, M. (1994) Polymorphic type inference and abstract data types. ACM Trans. Programming Languages and Systems (TOPLAS), 16(5): 1411-1430.
19. Leroy, X. (1994) Manifest types, modules, and separate compilation. Proc. 21st ACM Symp. on Principles of Programming Languages, pp. 109-123.
20. Liskov, B. and Guttag, J. (1986) Abstraction and Specification in Program Development. MIT Press.
21. MacQueen, D., Plotkin, G. and Sethi, R. (1986) An ideal model for recursive polymorphic types. Information and Control (71): 95-130.
22. Mitchell, J., Meldal, S. and Madhav, N. (1991) An extension of Standard ML modules with subtyping and inheritance. Proc. 18th ACM Symp. on Principles of Programming Languages.
23. Mitchell, J. and Plotkin, G. (1988) Abstract types have existential type. ACM Trans. Programming Languages and Systems 10(3): 470-502.
24. Nipkow, T. and Prehofer, C. (1993) Type checking type classes. Proc. 20th ACM Symp. Principles of Programming Languages.
25. Nipkow, T. and Snelting, G. (1991) Type classes and overloading resolution via order-sorted unification. Proc. Functional Programming Languages and Computer Architecture, pp. 1-14. Lecture Notes in Computer Science 523, Springer-Verlag.
26. Nipkow, T. and Snelting, G. (1991) Type classes and overloading resolution via order-sorted unification. Proc. Functional Programming Languages and Computer Architecture, pp. 1-14. Lecture Notes in Computer Science 523, Springer-Verlag.
27. Perry, N. (1990) The Implementation of Practical Functional Programming Languages. PhD thesis, Imperial College.
28. Pierce, B. and Turner, D. (1993) Simple type-theoretic foundations for object-oriented programming. Journal of Functional Programming.
29. Rémy, D. (1994) Programming objects with ML-ART: An extension to ML with abstract and record types. Proc. Intl. Symp. Theoretical Aspects of Computer Software (TACS). Lecture Notes in Computer Science, Springer-Verlag.
30. Stroustrup, B. (1986) The C++ Programming Language. Addison-Wesley.
31. Thatte, S. (1994) Semantics of type classes revisited. Proc. ACM Conf. Lisp and Functional Programming.
32. United States Department of Defense (1983) Reference Manual for the ADA Programming Language. Springer-Verlag.
33. Wadler, P. and Blott, S. (1989) How to make ad-hoc polymorphism less ad hoc. Proc. 16th ACM Symp. on Principles of Programming Languages, pp. 60-76.
34. Wirth, N. (1985) Programming in Modula-2. Springer-Verlag. 3rd edition.