The semantics of Scheme control-flow analysis

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The semantics of Scheme control-flow analysis

Full text

Pdf (809 KB)

Source

ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation archive
Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation table of contents

New Haven, Connecticut, United States

Pages: 190 - 198

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Author

Olin Shivers

School of Computer Science, Carnegie Mellon Pittsburgh, Pennsylvania

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 28, Citation Count: 19

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/115865.115884 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	A. W. Appel , T. Jim, Continuation-passing, closure-passing style, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.293-302, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75303]
	2	A. Bondorf, Automatic autoprojection of higher order recursive equations, Proceedings of the third European symposium on programming on ESOP '90, p.70-87, May 1990, Copenhagen, Denmark
	3	Patrick Cousot , Radhia Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.238-252, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512973]
	4	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]
	5	Adrienne Bloss , Paul Hudak, Variations on strictness analysis, Proceedings of the 1986 ACM conference on LISP and functional programming, p.132-142, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319857]
	6	David Kranz , Norman Adams , Richard Kelsey , Jonathan Rees , Paul Hudak , James Philbin, ORBIT: an optimizing compiler for scheme, Proceedings of the 1986 SIGPLAN symposium on Compiler construction, p.219-233, June 25-27, 1986, Palo Alto, California, United States
	7	John Reynolds, School of Computer Science, CMU. Personal communication.
	8	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]
	9	O. Shivers, Control flow analysis in scheme, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, p.164-174, June 20-24, 1988, Atlanta, Georgia, United States
	10	Olin Grigsby Shivers, Control-flow analysis of higher-order languages of taming lambda, Carnegie Mellon University, Pittsburgh, PA, 1991
	11	Olin Shivers. Data-flow analysis and type recovery in Scheme. Technical Report CMU-CS-90-115. CMU School of Computer Science, Pittsburgh, Penn., March 1990. Also to appear in Topics in Advanced Language Implementation, Peter Lee (editor), M1T Press.
	12	Olin Shivers, The semantics of Scheme control-flow analysis, Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.190-198, June 17-19, 1991, New Haven, Connecticut, United States
	13	Olin Shivers. Super-t: Copy, constant, and lambda propagation in Scheme. Working note #3, May 1990.
	14	Olin Shivers. Useless-variable elimination. Working note #2, April 1990.
	15	Guy L. Steele, Jr., Rabbit: A Compiler for Scheme, Massachusetts Institute of Technology, Cambridge, MA, 1978
	16	Jonathan Young and Paul Hudak. Finding fixpoints on function spaces. Research Report 505, Yale University, Department of Computer Science. December 1986.

CITED BY 19

	Olin Shivers , Matthew Might, Continuations and transducer composition, ACM SIGPLAN Notices, v.41 n.6, June 2006
	Suresh Jagannathan , Andrew Wright, Compiling functional languages with flow analysis, ACM Computing Surveys (CSUR), v.28 n.2, p.337-339, June 1996
	Danny Dubé , Marc Feeley, A demand-driven adaptive type analysis, ACM SIGPLAN Notices, v.37 n.9, p.84-97, September 2002
	Olin Shivers, The semantics of Scheme control-flow analysis, ACM SIGPLAN Notices, v.26 n.9, p.190-198, Sept. 1991
	Karl-Filip Faxén, Cheap eagerness: speculative evaluation in a lazy functional language, ACM SIGPLAN Notices, v.35 n.9, p.150-161, Sept. 2000
	Flemming Nielson , Hanne Riis Nielson, Infinitary control flow analysis: a collecting semantics for closure analysis, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.332-345, January 15-17, 1997, Paris, France
	Mary W. Hall , Ken Kennedy, Efficient call graph analysis, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.3, p.227-242, Sept. 1992
	Kirsten L. Solberg Gasser , Flemming Nielson , Hanne Riis Nielson, Systematic realisation of control flow analyses for CML, ACM SIGPLAN Notices, v.32 n.8, p.38-51, Aug. 1997
	J. Michael Ashley, A practical and flexible flow analysis for higher-order languages, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.184-194, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Suresh Jagannathan , Stephen Weeks, A unified treatment of flow analysis in higher-order languages, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.393-407, January 23-25, 1995, San Francisco, California, United States
	Philippe Meunier , Robert Bruce Findler , Paul Steckler , Mitchell Wand, Selectors Make Set-Based Analysis Too Hard, Higher-Order and Symbolic Computation, v.18 n.3-4, p.245-269, December 2005
	Danny Dubé , Marc Feeley, BIT: A Very Compact Scheme System for Microcontrollers, Higher-Order and Symbolic Computation, v.18 n.3-4, p.271-298, December 2005
	Suresh Jagannathan , Andrew Wright, Flow-directed inlining, ACM SIGPLAN Notices, v.31 n.5, p.193-205, May 1996
	J. Michael Ashley, The effectiveness of flow analysis for inlining, ACM SIGPLAN Notices, v.32 n.8, p.99-111, Aug. 1997
	Sean McDirmid, Living it up with a live programming language, ACM SIGPLAN Notices, v.42 n.10, October 2007
	Philippe Meunier , Robert Bruce Findler , Matthias Felleisen, Modular set-based analysis from contracts, ACM SIGPLAN Notices, v.41 n.1, p.218-231, January 2006
	Andrzej Filinski, Linear continuations, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.27-38, January 19-22, 1992, Albuquerque, New Mexico, United States
	Fritz Henglein, Global tagging optimization by type inference, ACM SIGPLAN Lisp Pointers, v.V n.1, p.205-215, Jan. 1992
	Suresh Jagannathan , Stephen Weeks, Analyzing stores and references in a parallel symbolic language, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.294-305, July-Sept. 1994