Order-of-evaluation analysis for destructive updates in strict functional languages with flat aggregates

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Order-of-evaluation analysis for destructive updates in strict functional languages with flat aggregates

Full text

Pdf (1.06 MB)

Source

Functional Programming Languages and Computer Architecture archive
Proceedings of the conference on Functional programming languages and computer architecture table of contents

Copenhagen, Denmark

Pages: 266 - 275

Year of Publication: 1993

ISBN:0-89791-595-X

Authors

A. V. S. Sastry
William Clinger
Zena Ariola

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: 8

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/165180.165222 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	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	2	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	3	Adrienne Gael Bloss, Path analysis and the optimization of nonstrict functional languages, 1989
	4	Adrienne Bloss, Update analysis and the efficient implementation of functional aggregates, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.26-38, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99373]
	5	Adrienne Bloss , Paul Hudak, Path Semantics, Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics, p.476-489, April 08-10, 1987
	6	David Cann, Retire Fortran?: a debate rekindled, Communications of the ACM, v.35 n.8, p.81-89, Aug. 1992 [doi>10.1145/135226.135231]
	7	D. Cann. Personal communication by electronic mail, February 1993.
	8	Alan Deutsch, On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.157-168, December 1989, San Francisco, California, United States [doi>10.1145/96709.96725]
	9	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 [doi>10.1145/91556.91658]
	10	Pascal Fradet, Syntactic detection of single-threading using continuations, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.241-258, June 1991, Cambridge, Massachusetts, United States
	11	Richard P. Gabriel, Performance and evaluation of LISP systems, Massachusetts Institute of Technology, Cambridge, MA, 1985
	12	Carsten K. Gomard , Peter Sestoft, Globalization and live variables, Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.166-177, June 17-19, 1991, New Haven, Connecticut, United States
	13	K. Gopinath, Copy elimination in single assignment languages, Stanford University, Stanford, CA, 1988
	14	J. Guzm&n and P. Hudak. Single-threaded polymorphic lambda calculus. In IEEE Symposium on Logic in Computer Science, 1990.
	15	James Edward Hicks, Jr., Compiler-directed storage reclamation using object lifetime analysis, Massachusetts Institute of Technology, Cambridge, MA, 1992
	16	Paul Hudak, A semantic model of reference counting and its abstraction (detailed summary), Proceedings of the 1986 ACM conference on LISP and functional programming, p.351-363, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319876]
	17	Thomas Johnsson, Lambda lifting: transforming programs to recursive equations, Proc. of a conference on Functional programming languages and computer architecture, p.190-203, January 1985, Nancy, France
	18	R. Nikhil. Id (version 90.0) reference manual. Technical Report CSG Memo 284-1, 545 Technology Square, Cambridge, MA 02139, August 1990.
	19	A. Sastry and W. Clinger. Order-of-evaluation analysis for destructive updates in strict functional languages with flat aggregates. Technical Report CIS-TR-92-14, University of Oregon Dept. of Computer Science, 1992.
	20	David A. Schmidt, Detecting global variables in denotational specifications, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.2, p.299-310, April 1985 [doi>10.1145/3318.3323]
	21	David A. Schmidt, Denotational semantics: a methodology for language development, William C. Brown Publishers, Dubuque, IA, 1986
	22	P. Sestoft. Replacing function parameters with global variables. Master's thesis, DIKU, University of Copenhagen, Oct. 1988.
	23	Peter Sestoft, Replacing function parameters by global variables, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.39-53, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99374]
	24	R. Sethi. Pebble games for studying storage sharing. Theoretical Computer Science, 19(1):69-84, July 1982.
	25	P. Wadler. Linear types can change the world! In M. Broy and C. B. Jones, editors, Programming Concepts and Methods. North Holland, 1990. Presented at IFiP TC2 Working Conference on Programming Concepts and Methods, Sea of Galilee, Israel, April 1990.

CITED BY 8

	Chris Okasaki, Purely functional random-access lists, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.86-95, June 26-28, 1995, La Jolla, California, United States
	Tyng-Ruey Chuang, A randomized implementation of multiple functional arrays, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.173-184, July-Sept. 1994
	A. V. S. Sastry , William Clinger, Parallel destructive updating in strict functional languages, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.263-272, July-Sept. 1994
	Zhonghua Li , Chris Kirkham, Efficient implementation of aggregates in united functions and objects, Proceedings of the 33rd annual on Southeast regional conference, March 17-18, 1995, Clemson, South Carolina
	Jonathan D. Bright , Gregory F. Sullivan , Gerald M. Masson, A Formally Verified Sorting Certifier, IEEE Transactions on Computers, v.46 n.12, p.1304-1312, December 1997
	Mitchell Wand, Analysis-based program transformations, ACM SIGSOFT Software Engineering Notes, v.25 n.1, p.91-92, Jan 2000
	Martin Erwig, Inductive graphs and functional graph algorithms, Journal of Functional Programming, v.11 n.5, p.467-492, September 2001
	Mitchell Wand , William D. Clinger, Set constraints for destructive array update optimization, Journal of Functional Programming, v.11 n.3, p.319-346, May 2001