A theory of incremental computation and its application

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A theory of incremental computation and its application

Full text

Pdf (1.17 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

Orlando, Florida, United States

Pages: 1 - 13

Year of Publication: 1991

ISBN:0-89791-419-8

Authors

R. S. Sundaresh	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

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 26, Citation Count: 16

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/99583.99587 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.

	CD90	C. Consel , O. Danvy, From interpreting to compiling binding times, Proceedings of the third European symposium on programming on ESOP '90, p.88-105, May 1990, Copenhagen, Denmark
	FT90	John Field , Tim Teitelbaum, Incremental reduction in the lambda calculus, Proceedings of the 1990 ACM conference on LISP and functional programming, p.307-322, June 27-29, 1990, Nice, France [doi>10.1145/91556.91679]
	Fut71	Y. Futamura. Partial evaluation of computation process-an approach to a compiler-compiler. Systems, Computers, Controls, 2(5), 1971.
	HWe90	P. Hudak and P. Wadler (editors). Report on the programming language Haskell. Technical Report YALEU/DCS/RR-777, Yale University, Department of Computer Science, April 1990.
	JSS89	N.D. Jones, P. Sestoft, and H. Sendergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1), 1989.
	Knu68	D. Knuth. Semantics of context-free languages. Math Systems Theory, 2(2):127-145, February 1968.
	Lau88	J. Launchbury. Projections for specialisation. In A.P.Ershov D.Bjerner and N.D.Jones, editors, Partial Evaluation and Mixed Computation. North-Holland, 1988.
	LR64	L.A. Lombardi and B. Raphael. Lisp as the language for an incremental computer. In The Programming Language LISP: lts Operation and Applications, pages 204-219. information International Inc., The MIT Press, 1964.
	MR90	Thomas J. Marlowe , Barbara G. Ryder, An efficient hybrid algorithm for incremental data flow analysis, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.184-196, December 1989, San Francisco, California, United States [doi>10.1145/96709.96728]
	MT46	J.C.C. McKinsey and A. Tarski. On closed elements in closure algebras. Annals of Mathematics, 47(1), January 1946.
	Pug88	William Worthington Pugh, Jr., Incremental computation and the incremental evaluation of functional programs, 1988
	Rep84	Thomas W. Reps, Generating language-based environments, Massachusetts Institute of Technology, Cambridge, MA, 1984
	Rep90	T. Reps, Algebraic properties of program integration, Proceedings of the third European symposium on programming on ESOP '90, p.326-340, May 1990, Copenhagen, Denmark
	RTD83	Thomas Reps , Tim Teitelbaum , Alan Demers, Incremental Context-Dependent Analysis for Language-Based Editors, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.3, p.449-477, July 1983 [doi>10.1145/2166.357218]
	Sun90	R.S. Sundaresh. Implementing incremental computaion via partial evaluation. Technical Report YALEU/DCS/RR828, Yale University, Department of Computer Science, November 1990.
	Sun91	Raman Srinivas Sundaresh, Incremental computation via partial evaluation, Yale University, New Haven, CT, 1992
	YS89	D. Yellin and R. Strom. INC: A language for incremental computation. Technical report, IBM, RC 14375(#64375) 1989.

CITED BY 16

	Charles Consel , Olivier Danvy, Tutorial notes on partial evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.493-501, March 1993, Charleston, South Carolina, United States
	Todd B. Knoblock , Erik Ruf, Data specialization, ACM SIGPLAN Notices, v.31 n.5, p.215-225, May 1996
	Bradley T. Vander Zanden , Richard Halterman , Brad A. Myers , Rich McDaniel , Rob Miller , Pedro Szekely , Dario A. Giuse , David Kosbie, Lessons learned about one-way, dataflow constraints in the Garnet and Amulet graphical toolkits, ACM Transactions on Programming Languages and Systems (TOPLAS), v.23 n.6, p.776-796, November 2001
	Yanhong A. Liu , Scott D. Stoller , Tim Teitelbaum, Discovering auxiliary information for incremental computation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.157-170, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Yanhong A. Liu , Tim Teitelbaum, Caching intermediate results for program improvement, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.190-201, June 21-23, 1995, La Jolla, California, United States
	Rogardt Heldal , John Hughes, Partial evaluation and separate compilation, ACM SIGPLAN Notices, v.32 n.12, p.1-11, Dec. 1997
	Brian Guenter , Todd B. Knoblock , Erik Ruf, Specializing shaders, Proceedings of the 22nd annual conference on Computer graphics and interactive techniques, p.343-350, September 1995
	R. S. Sundaresh, Building incremental programs using partial evaluation, ACM SIGPLAN Notices, v.26 n.9, p.83-93, Sept. 1991
	Steven Carroll , Constantine Polychronopoulos, A framework for incremental extensible compiler construction, Proceedings of the 17th annual international conference on Supercomputing, June 23-26, 2003, San Francisco, CA, USA
	Aaron Ceglar , John F. Roddick , Paul Calder, Guiding knowledge discovery through interactive data mining, Managing data mining technologies in organizations: techniques and applications, Idea Group Publishing, Hershey, PA, 2003
	Umut A. A. Acar , Guy E. Blelloch , Robert Harper, Selective memoization, ACM SIGPLAN Notices, v.38 n.1, p.14-25, January 2003
	Yanhong A. Liu, Efficiency by Incrementalization: An Introduction, Higher-Order and Symbolic Computation, v.13 n.4, p.289-313, Dec. 1, 2000
	Steven Carroll , Constantine Polychronopoulos, A framework for incremental extensible compiler construction, International Journal of Parallel Programming, v.32 n.4, p.289-316, August 2004
	Umut A. Acar , Guy E. Blelloch , Robert Harper, Adaptive functional programming, ACM SIGPLAN Notices, v.37 n.1, p.247-259, Jan. 2002
	Yanhong A. Liu , Scott D. Stoller , Tim Teitelbaum, Static caching for incremental computation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.3, p.546-585, May 1998
	Umut A. Acar , Guy E. Blelloch , Robert Harper, Adaptive functional programming, ACM Transactions on Programming Languages and Systems (TOPLAS), v.28 n.6, p.990-1034, November 2006