Incremental λ-Calculus in Cache-Transfer Style Static Memoization by Program Transformation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Incremental λ-Calculus in Cache-Transfer Style Static Memoization by Program Transformation

Abstract

Incremental computation requires propagating changes and reusing intermediate results of base computations. Derivatives, as produced by static differentiation [7], propagate changes but do not reuse intermediate results, leading to wasteful recomputation. As a solution, we introduce conversion to Cache-Transfer-Style, an additional program transformations producing purely incremental functional programs that create and maintain nested tuples of intermediate results. To prove CTS conversion correct, we extend the correctness proof of static differentiation from STLC to untyped λ-calculus via step-indexed logical relations, and prove sound the additional transformation via simulation theorems. To show ILC-based languages can improve performance relative to from-scratch recomputation, and that CTS conversion can extend its applicability , we perform an initial performance case study. We provide derivatives of primitives for operations on collections and incrementalize selected example programs using those primitives, confirming expected asymptotic speedups.
Fichier principal
Vignette du fichier
giarusso19incremental.pdf (700.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02405864 , version 1 (11-12-2019)

Identifiers

  • HAL Id : hal-02405864 , version 1

Cite

Paolo G Giarrusso, Yann Régis-Gianas, Philipp Schuster. Incremental λ-Calculus in Cache-Transfer Style Static Memoization by Program Transformation. ESOP 2019 - European Symposium on Programming, Apr 2019, Prague, Czech Republic. ⟨hal-02405864⟩
166 View
87 Download

Share

Gmail Facebook X LinkedIn More