Optimizing memory usage in higher-order programming languages: theoretical and experimental studies
Page 92
Abstract
No abstract available.
References
[1]
[Shi91] Olin Shivers. Control-Flow Analysis of Higher-Order Languages . PhD thesis, Carnegie-Mellon University, May 1991.
[2]
[SW97] Paul A. Steckler and Mitchell Wand. Lightweight closure conversion. ACM Transactions on Programming Languages and Systems, pages 48-86, January 1997. Original version appeared in Proceedings 21st Annual ACM Symposium on Principles of Programming Languages, 1994.
[3]
[Wan93] Mitchell Wand. Specifying the correctness of binding-time analysis. Journal of Functional Programming, 3(3):365-387, July 1993, preliminary version appeared in Conf. Rec. 20th ACM Symp. on Principles of Prog. Lang. (1993), 137-143.
[4]
[WC98] Mitchell Wand and William D. Clinger. Set constraints for destructive array update optimization. In Proc. IEEE Conf. on Computer Languages '98, pages 184-193. IEEE, April 1998.
[5]
[WS97] Mitchell Wand and Gregory T. Sullivan. Denotational semantics using an operationally-based term model. In Proceedings 23rd Annual ACM Symposium on Principles of Programming Languages, pages 386-399, 1997.
[6]
[WS99] Mitchell Wand and Igor Siveroni. Constraint systems for useless variable elimination. In Proceedings 26th Annual ACM Symposium on Principles of Programming Languages, pages 291-302, 1999.
Index Terms
- Optimizing memory usage in higher-order programming languages: theoretical and experimental studies
Recommendations
Higher-order equational logic programming
POPL '94: Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languagesHigher-order equational logic programming is a paradigm which combines first-order equational and higher-order logic programming, where higher-order logic programming is based on a subclass of simply typed λ-terms, called higher-order patterns. Central ...
Extensional Higher-Order Logic Programming
We propose a purely extensional semantics for higher-order logic programming. In this semantics program predicates denote sets of ordered tuples, and two predicates are equal iff they are equal as sets. Moreover, every program has a unique minimum ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2000 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 January 2000
Published in SIGSOFT Volume 25, Issue 1
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 151Total Downloads
- Downloads (Last 12 months)28
- Downloads (Last 6 weeks)4
Reflects downloads up to 20 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in