Parametricity, in both operational and denotational forms, has long been a useful tool for reasoning about program correctness. However, there is as yet no comparable technique for reasoning about program improvement, that is, when one program uses fewer resources than another. Existing theories of parametricity cannot be used to address this problem as they are agnostic with regard to resource usage. This article addresses this problem by presenting a new operational theory of parametricity that is sensitive to time costs, which can be used to reason about time improvement properties. We demonstrate the applicability of our theory by showing how it can be used to prove that a number of well-known program fusion techniques are time improvements, including fixed point fusion, map fusion and short cut fusion.
Wed 26 SepDisplayed time zone: Guadalajara, Mexico City, Monterrey change
15:00 - 16:10
|Parallel Complexity Analysis with Temporal Session Types|
Ankush Das Carnegie Mellon University, Jan Hoffmann Carnegie Mellon University, Frank Pfenning Carnegie Mellon University, USADOI
|Parametric Polymorphism and Operational Improvement|
|Tight Typings and Split Bounds|
Beniamino Accattoli Inria & Ecole Polytechnique, Stéphane Graham-Lengrand CNRS, France, Delia Kesner IRIF, France / University of Paris Diderot, FranceDOI