ACM Home Page
Please provide us with feedback. Feedback
Untagged data in tagged environments: choosing optimal representations at compile time
Full text PdfPdf (984 KB)
Source Functional Programming Languages and Computer Architecture archive
Proceedings of the fourth international conference on Functional programming languages and computer architecture table of contents
Imperial College, London, United Kingdom
Pages: 89 - 99  
Year of Publication: 1989
ISBN:0-89791-328-0
Author
John Peterson  Department of Computer Science, University of Arizona, Tucson, AZ
Sponsors
SIGARCH: ACM Special Interest Group on Computer Architecture
IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Citation Count: 6
Additional Information:

references   cited by   index terms  

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/99370.99377
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
Steele, G. L., "Fast Arithmetic in MacLisp," Proceedings of the 1977 MA CSYMA Users' Conference, NASA Scientific and Technic&l Information Office, Washington, D.C., July 1977.
 
3
Appel, A. W., "Runtime Tags Aren't Necessary," Princeton University Department of Computer Science Tech Report CS-TR-142-88, March 1988. To appear in the Journal of Lisp and Symbolic Programming.
 
4
5
6
 
7
Goldberg, A. V., and Tarjan, R. E., "A New Approach to the Maximum Flow Problem," Princeton University Department of Computer Science Tech Report CS-TR-050-86, April 1986.
 
8