ACM Home Page
Please provide us with feedback. Feedback
Simplifying and improving qualified types
Full text PdfPdf (1.02 MB)
Source Functional Programming Languages and Computer Architecture archive
Proceedings of the seventh international conference on Functional programming languages and computer architecture table of contents
La Jolla, California, United States
Pages: 160 - 169  
Year of Publication: 1995
ISBN:0-89791-719-7
Author
Mark P. Jones  Department of Computer Science, University of Nottingham, University Park, Nottingham, NG7 2RD
Sponsors
IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 38,   Citation Count: 17
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/224164.224198
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
 
4
5
 
6
R.W. Harper and B.C. Pierce. Extensible records without subsumption. TechnicM report CMU-CS-90-102, Carnegie Mellon University, School of computer science, February 1990.
7
 
8
Mark P. Jones. Introduction to Gofer 2.20, September 1991. Available by anonymous ftp as part of the standard Gofer distribution.
 
9
Mark P. Jones. Computing with lattices: An application of type classes. Journal of Functional Programming, 2(4), October 1992.
 
10
 
11
 
12
Mark P. Jones. Coherence for qualified types. Research Report YALEU/DCS/RR-989, Yale ltniversity, New Haven, Connecticut, USA, September 1993.
13
 
14
Mark P. Jones. The implementation of the Gofer functional programming system. Research Report YALEU/DCS/RR-1030, Yale University, New Haven, Connecticut, USA, May 1994.
 
15
Mark P. Jones. Simplifying and improving qualified types. Research Report YALEU/DCS/RR-1040, Yale University, New Haven, Connecticut, USA, June 1994.
16
 
17
J.C. Mitchell. Type inference with simple subtypes. Journal of functional programming, 1(3):245-286, July 1991
18
 
19
Geoffrey Seward Smith. Polymorphic type inference for languages with overloading and subtyping. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York, August 1991.
 
20
21

CITED BY  17