Refinement Types for Incremental Computational Complexity

Abstract : With recent advances, programs can be compiled to efficiently respond to incremental input changes. However, there is no language level support for reasoning about the time complexity of incremental updates. Motivated by this gap, we present CostIt, a higher-order functional language with a lightweight refinement type system for proving asymptotic bounds on incremental computation time. Type refinements specify which parts of inputs and outputs may change, as well as dynamic stability, a measure of time required to propagate changes to a program's execution trace, given modified inputs. We prove our type system sound using a new step-indexed cost semantics for change propagation and demonstrate the precision and generality of our technique through examples.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01245888
Contributor : Arthur Charguéraud <>
Submitted on : Thursday, December 17, 2015 - 5:43:37 PM
Last modification on : Monday, August 20, 2018 - 1:36:04 PM

Links full text

Identifiers

Collections

Citation

Ezgi Çiçek, Deepak Garg, Umut Acar. Refinement Types for Incremental Computational Complexity. 24th European Symposium on Programming (ESOP), Apr 2015, London, United Kingdom. pp.406-431, ⟨10.1007/978-3-662-46669-8_17⟩. ⟨hal-01245888⟩

Share

Metrics

Record views

163