SIGN IN
SIGN UP
Using the heap to eliminate stack accesses
Full Text:
Pdf
Buy this Article
Authors:
Zoltan Somogyi
The University of Melbourne, 3010, Australia
Peter J. Stuckey
The University of Melbourne, 3010, Australia
Published in:
· Proceeding
PPDP '02
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Pages 121 - 132
ACM
New York, NY
, USA
©2002
table of contents
ISBN:1-58113-528-9
doi>
10.1145/571157.571170
2002 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 9
· Downloads (cumulative): 191
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
compilers
constraint and logic languages
graph algorithms
heap cells
languages
maximal matching
optimization
stack accesses
stack frames
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder