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 language | English |
|---|---|
| Pages | 350 |
| Number of pages | 1 |
| DOIs | |
| State | Published - 1998 |
| Event | Proceedings of the 1998 3rd ACM SIGPLAN International Conference on Functional Programming, ICFP-98 - Baltimore, MD, USA Duration: Sep 27 1998 → Sep 29 1998 |
Conference
| Conference | Proceedings of the 1998 3rd ACM SIGPLAN International Conference on Functional Programming, ICFP-98 |
|---|---|
| City | Baltimore, MD, USA |
| Period | 09/27/98 → 09/29/98 |
Fingerprint
Dive into the research topics of 'Automating derivation of incremental programs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver