ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Variations on strictness analysis
Full text PdfPdf (791 KB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1986 ACM conference on LISP and functional programming table of contents
Cambridge, Massachusetts, United States
Pages: 132 - 142  
Year of Publication: 1986
ISBN:0-89791-200-4
Authors
Adrienne Bloss  Yale University, Department of Computer Science, Box 2158 Yale Station, New Haven, CT
Paul Hudak  Yale University, Department of Computer Science, Box 2158 Yale Station, New Haven, CT
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 12,   Citation Count: 5
Additional Information:

references   cited by   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/319838.319857
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
G.L. Burn, C.L. Hankin, and S. Abramsky. The theory and practice of strictness analysis for hither order functions. Technical Report DoC 85/6, Imperial College of Science and Technology, Department of Computing, April 1985.
 
2
Chris Clack , Simon L. Peyton Jones, Strictness analysis—a practical approach, Proc. of a conference on Functional programming languages and computer architecture, p.35-49, January 1985, Nancy, France
3
Paul Hudak , Jonathan Young, Higher-order strictness analysis in untyped lambda calculus, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.97-109, January 01, 1986, St. Petersburg Beach, Florida  [doi>10.1145/512644.512653]
 
4
T. Johnsson. Detecting when call-by-value can be used instead of call-by-need. Laboratory for Programming Methodology Memo 14, Ohalmers University of Technology, Dept. of Computer Science, October 1981.
 
5
A. MycrofL Abstract Interpretation and Optimizing Transformations for Applicaffv~ Programs. PhD thesis, Univ. of Edinburgh, 1981.
 
6
Alan Mycroft, The Theory and Practice of Transforming Call-by-need into Call-by-value, Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming, p.269-281, April 22-24, 1980

CITED BY  5
M. Draghicescu , S. Purushothaman, A compositional analysis of evaluation-order and its application, Proceedings of the 1990 ACM conference on LISP and functional programming, p.242-250, June 27-29, 1990, Nice, France
C. V. Hall , D. S. Wise, Compiling strictness into streams, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.132-143, January 21-23, 1987, Munich, West Germany
David J. Roth , David S. Wise, One-bit counts between unique and sticky, ACM SIGPLAN Notices, v.34 n.3, p.49-56, March 1999
Olin Shivers, The semantics of Scheme control-flow analysis, ACM SIGPLAN Notices, v.26 n.9, p.190-198, Sept. 1991
Adrienne Bloss, Path analysis and the optimization of nonstrict functional languages, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.328-369, May 1994
Collaborative Colleagues:
Adrienne Bloss: colleagues
Paul Hudak: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player