Eberhard Karls Universität Tübingen

Mathematisch-Naturwissenschaftliche FakultätProgramming Languages and Software Technology

Incremental λ-Calculus

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.

Project homepage

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.


Open Thesis Topics

ILC: Creating an API for producing changes

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 ...