Write a Blog >>
ICFP 2018
Sun 23 - Sat 29 September 2018 St. Louis, Missouri, United States
Wed 26 Sep 2018 15:23 - 15:46 at Stifel Theatre - Complexity and Bounds Chair(s): Ilya Sergey

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 Sep
Times are displayed in time zone: (GMT-05:00) Guadalajara, Mexico City, Monterrey change

icfp-2018-papers
15:00 - 16:10: Research Papers - Complexity and Bounds at Stifel Theatre
Chair(s): Ilya SergeyUniversity College London
icfp-2018-papers15:00 - 15:23
Talk
Ankush DasCarnegie Mellon University, Jan HoffmannCarnegie Mellon University, Frank PfenningCarnegie Mellon University, USA
DOI
icfp-2018-papers15:23 - 15:46
Talk
Jennifer HackettUniversity of Nottingham, UK, Graham HuttonUniversity of Nottingham, UK
DOI
icfp-2018-papers15:46 - 16:10
Talk
Beniamino AccattoliInria & Ecole Polytechnique, St├ęphane Graham-LengrandCNRS, France, Delia KesnerIRIF, France / University of Paris Diderot, France
DOI