Skip to main navigation Skip to search Skip to main content

Automating derivation of incremental programs

  • Indiana University Bloomington

Research output: Contribution to conferencePaperpeer-review

7 Scopus citations

Abstract

Given a program f and an input change operation ⊕, an incremental program f′ computes the value of f(x⊕y) efficiently by making use of the value of f(x). The derivation of incremental programs shares the same underlying principle with finite differencing and a number of other program optimization. It is crucial for optimizing programs in high-level languages. An approach to automate the derivation of f′ from f and ⊕ based on a semi-automatic implementation - CACHET.

Original languageEnglish
Pages350
Number of pages1
DOIs
StatePublished - 1998
EventProceedings of the 1998 3rd ACM SIGPLAN International Conference on Functional Programming, ICFP-98 - Baltimore, MD, USA
Duration: Sep 27 1998Sep 29 1998

Conference

ConferenceProceedings of the 1998 3rd ACM SIGPLAN International Conference on Functional Programming, ICFP-98
CityBaltimore, MD, USA
Period09/27/9809/29/98

Fingerprint

Dive into the research topics of 'Automating derivation of incremental programs'. Together they form a unique fingerprint.

Cite this