Yan ChenUmut A. AcarKanat TangwongsanMax Planck Institute for Software SystemsCarnegie Mellon UniversityMahidol University2018-11-092018-11-092014-01-01Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP. (2014), 227-2402-s2.0-84907012204https://repository.li.mahidol.ac.th/handle/20.500.14594/33750Combining type theory, language design, and empirical work, we present techniques for computing with large and dynamically changing datasets. Based on lambda calculus, our techniques are suitable for expressing a diverse set of algorithms on large datasets and, via self-adjusting computation, enable computations to respond automatically to changes in their data. To improve the scalability of self-adjusting computation, we present a type system for precise dependency tracking that minimizes the time and space for storing dependency metadata. The type system eliminates an important assumption of prior work that can lead to recording spurious dependencies. We present a type-directed translation algorithm that generates correct self-adjusting programs without relying on this assumption. We then show a probabilistic-chunking technique to further decrease space usage by controlling the fundamental space-time tradeoff in self-adjusting computation. We implement and evaluate these techniques, showing promising results on challenging benchmarks involving large graphs. © 2014 ACM.Mahidol UniversityComputer ScienceConference PaperSCOPUS10.1145/2628136.2628150