Article

Free access

A theory of incremental computation and its application

Authors:

R. S. Sundaresh,

Paul HudakAuthors Info & Claims

POPL '91: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 1 - 13

https://doi.org/10.1145/99583.99587

Published: 03 January 1991 Publication History

PDF eReader

References

[1]

C. Consel and O. Danvy. From interpreting to compiling binding times. In Proceedings of the 3rd European Symposium on Programming, Lecture Notes in Computer Science, Vol. 432. Springer- Verlag, May 1990.

Digital Library

Google Scholar

[2]

J. Field and T. Teitelbaum. Incremental reduction in the lambda calculus, in Proceedings of the 1990 A CM Conference on Lisp and Functional Programming, June 1990.

Digital Library

Google Scholar

[3]

Y. Futamura. Partial evaluation of computation process-an approach to a compiler-compiler. Systems, Computers, Controls, 2(5), 1971.

Google Scholar

[4]

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.

Google Scholar

[5]

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.

Google Scholar

[6]

D. Knuth. Semantics of context-free languages. Math Systems Theory, 2(2):127-145, February 1968.

Crossref

Google Scholar

[7]

J. Launchbury. Projections for specialisation. In A.P.Ershov D.Bjerner and N.D.Jones, editors, Partial Evaluation and Mixed Computation. North-Holland, 1988.

Google Scholar

[8]

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.

Google Scholar

[9]

T.J. Marlowe and B. G. Ryder. An efficient hybrid algorithm for incremental data flow analysis. In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990.

Digital Library

Google Scholar

[10]

J.C.C. McKinsey and A. Tarski. On closed elements in closure algebras. Annals of Mathematics, 47(1), January 1946.

Google Scholar

[11]

W. W. Pugh, Jr. Incremental Computation and the Incremental Evaluation of Functional Programs. PhD thesis, Cornell University, August 1988.

Digital Library

Google Scholar

[12]

T.W. Reps. Generating Language-Based Environments. The MIT Press, 1984.

Digital Library

Google Scholar

[13]

T. Reps. Algebraic properties of program integration. In Proceedings of the 3rd European Symposium on Programming, Lecture Notes in Computer Science, Vol. ~32. Springer-Verlag, May 1990.

Digital Library

Google Scholar

[14]

T. Reps, T. Teitelbaum, and A. Demers. Incremental context dependent analysis for languagebased editors. A CM Transactions on Programming Languages and Systems, 5(3):449-477, July 1983.

Digital Library

Google Scholar

[15]

R.S. Sundaresh. Implementing incremental computaion via partial evaluation. Technical Report YALEU/DCS/RR828, Yale University, Department of Computer Science, November 1990.

Google Scholar

[16]

R.S. Sundaresh. Incremental Computation and Partial Evaluation. PhD thesis, Yale University, (Forthcoming) 1991.

Digital Library

Google Scholar

[17]

D. Yellin and R. Strom. INC: A language for incremental computation. Technical report, IBM, RC 14375(#64375) 1989.

Google Scholar

Cited By

View all

Hammer MNeis GChen YAcar U(2011)Self-adjusting stack machinesACM SIGPLAN Notices10.1145/2076021.204812446:10(753-772)Online publication date: 22-Oct-2011
https://dl.acm.org/doi/10.1145/2076021.2048124
Hammer MNeis GChen YAcar ULopes CFisher K(2011)Self-adjusting stack machinesProceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications10.1145/2048066.2048124(753-772)Online publication date: 22-Oct-2011
https://dl.acm.org/doi/10.1145/2048066.2048124
Acar UBlelloch GLey-Wild RTangwongsan KTurkoglu D(2010)Traceable data types for self-adjusting computationACM SIGPLAN Notices10.1145/1809028.180665045:6(483-496)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1809028.1806650
Show More Cited By

Index Terms

A theory of incremental computation and its application
1. Software and its engineering
  1. Software creation and management
    1. Designing software
      1. Software implementation planning
        Software design techniques
    2. Software development process management
  2. Software notations and tools
    1. Compilers
      1. Parsers
    2. Development frameworks and environments
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Functional constructs

Recommendations

Incremental computation with names
OOPSLA 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications

Over the past thirty years, there has been significant progress in developing general-purpose, language-based approaches to incremental computation, which aims to efficiently update the result of a computation when an input is changed. A key design ...
Incremental computation: a semantics-based systematic transformational approach
Incremental computation with names
OOPSLA '15

Over the past thirty years, there has been significant progress in developing general-purpose, language-based approaches to incremental computation, which aims to efficiently update the result of a computation when an input is changed. A key design ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

POPL '91: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 1991

366 pages

ISBN:0897914198

DOI:10.1145/99583

Chairman:
David Wise
Indiana Univ., Bloomington

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 January 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL91

Sponsor:

POPL91: 18th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages

January 21 - 23, 1991

Florida, Orlando, USA

Acceptance Rates

POPL '91 Paper Acceptance Rate 31 of 152 submissions, 20%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
625
Total Downloads

Downloads (Last 12 months)108
Downloads (Last 6 weeks)17

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hammer MNeis GChen YAcar U(2011)Self-adjusting stack machinesACM SIGPLAN Notices10.1145/2076021.204812446:10(753-772)Online publication date: 22-Oct-2011
https://dl.acm.org/doi/10.1145/2076021.2048124
Hammer MNeis GChen YAcar ULopes CFisher K(2011)Self-adjusting stack machinesProceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications10.1145/2048066.2048124(753-772)Online publication date: 22-Oct-2011
https://dl.acm.org/doi/10.1145/2048066.2048124
Acar UBlelloch GLey-Wild RTangwongsan KTurkoglu D(2010)Traceable data types for self-adjusting computationACM SIGPLAN Notices10.1145/1809028.180665045:6(483-496)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1809028.1806650
Acar UBlelloch GLey-Wild RTangwongsan KTurkoglu DZorn BAiken A(2010)Traceable data types for self-adjusting computationProceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1806596.1806650(483-496)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1806596.1806650
Meijler TNytun JPrinz AWortmann H(2010)Supporting fine-grained generative model-driven evolutionSoftware & Systems Modeling10.1007/s10270-009-0144-19:3(403-424)Online publication date: 9-Jan-2010
https://doi.org/10.1007/s10270-009-0144-1
Launchbury J(2005)A strongly-typed self-applicable partial evaluatorFunctional Programming Languages and Computer Architecture10.1007/3540543961_8(145-164)Online publication date: 6-Jul-2005
https://doi.org/10.1007/3540543961_8
Carroll SPolychronopoulos CBanerjee UGallivan KGonzalez A(2003)A framework for incremental extensible compiler constructionProceedings of the 17th annual international conference on Supercomputing10.1145/782814.782824(53-62)Online publication date: 23-Jun-2003
https://dl.acm.org/doi/10.1145/782814.782824
Acar UBlelloch GHarper R(2003)Selective memoizationACM SIGPLAN Notices10.1145/640128.60413338:1(14-25)Online publication date: 15-Jan-2003
https://dl.acm.org/doi/10.1145/640128.604133
Acar UBlelloch GHarper RAiken AMorrisett G(2003)Selective memoizationProceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/604131.604133(14-25)Online publication date: 15-Jan-2003
https://dl.acm.org/doi/10.1145/604131.604133
Acar UBlelloch GHarper R(2002)Adaptive functional programmingACM SIGPLAN Notices10.1145/565816.50329637:1(247-259)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.1145/565816.503296
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Incremental computation with names

Incremental computation: a semantics-based systematic transformational approach

Incremental computation with names