skip to main content
10.1145/99583.99587acmconferencesArticle/Chapter ViewAbstractPublication PagespoplConference Proceedingsconference-collections
Article
Free Access

A theory of incremental computation and its application

Authors Info & Claims
Published:03 January 1991Publication History
First page image

References

  1. CD90.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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. FT90.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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Fut71.Y. Futamura. Partial evaluation of computation process-an approach to a compiler-compiler. Systems, Computers, Controls, 2(5), 1971.Google ScholarGoogle Scholar
  4. 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.Google ScholarGoogle Scholar
  5. 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.Google ScholarGoogle Scholar
  6. Knu68.D. Knuth. Semantics of context-free languages. Math Systems Theory, 2(2):127-145, February 1968.Google ScholarGoogle ScholarCross RefCross Ref
  7. 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.Google ScholarGoogle Scholar
  8. 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.Google ScholarGoogle Scholar
  9. MR90.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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. MT46.J.C.C. McKinsey and A. Tarski. On closed elements in closure algebras. Annals of Mathematics, 47(1), January 1946.Google ScholarGoogle Scholar
  11. Pug88.W. W. Pugh, Jr. Incremental Computation and the Incremental Evaluation of Functional Programs. PhD thesis, Cornell University, August 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Rep84.T.W. Reps. Generating Language-Based Environments. The MIT Press, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Rep90.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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. RTD83.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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Sun90.R.S. Sundaresh. Implementing incremental computaion via partial evaluation. Technical Report YALEU/DCS/RR828, Yale University, Department of Computer Science, November 1990.Google ScholarGoogle Scholar
  16. Sun91.R.S. Sundaresh. Incremental Computation and Partial Evaluation. PhD thesis, Yale University, (Forthcoming) 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. YS89.D. Yellin and R. Strom. INC: A language for incremental computation. Technical report, IBM, RC 14375(#64375) 1989.Google ScholarGoogle Scholar

Index Terms

  1. A theory of incremental computation and its application

            Recommendations

            Comments

            Login options

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

            Sign in
            • Published in

              cover image ACM Conferences
              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

              Copyright © 1991 ACM

              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: 3 January 1991

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              POPL '91 Paper Acceptance Rate31of152submissions,20%Overall Acceptance Rate824of4,130submissions,20%

              Upcoming Conference

              POPL '25

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader