The goal of the Incremental λ-Calculus project is to extend database technology for low-overhead incremental computation, based on finite differencing, and apply it to higher-order languages.
More information can be found on the external project homepage of this project.
A Theory of Changes for Higher-Order Languages — Incrementalizing λ-Calculi by Static Differentiation
by Yufei Cai, Paolo G. Giarrusso, Tillmann Rendel, and Klaus Ostermann
In Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014.
ResearcherPaolo G. Giarrusso delivers an invited talk Incrementalizing λ-Calculi by Static Differentiation: A Theory of Changes for Higher-Order Languages and Ongoing Work at the PPS seminar of the University Paris Diderot (Paris 7). The talk is based on our PLDI 2014 paper and ongoing work in the “incremental λ-calculus” project.
Read more ...
Open Thesis Topics
In incremental lambda calculus, to update the output we need a
description (represented as data) of how the input of a program changes.
Comparing the old and the new input is overly expensive; instead, it would be
convenient to create a description of the changes while they happen. The goal of
this thesis is to design (and implement) a solution to this problem, focusing on
the case of collections.
Read more ...