Write a Blog >>
ICFP 2020
Thu 20 - Fri 28 August 2020
Wed 26 Aug 2020 15:15 - 15:30 at ICFP NY 6 - New York 6 Chair(s): Sukyoung Ryu
Thu 27 Aug 2020 03:15 - 03:30 at ICFP Asia 6 - Asia 6 Chair(s): Sukyoung Ryu

This article presents a type-based analysis for deriving upper bounds on the expected execution cost of probabilistic programs. The analysis is naturally compositional, parametric in the cost model, and supports higher-order functions and inductive data types. The derived bounds are multivariate polynomials that are functions of data structures. Bound inference is enabled by local type rules that reduce type inference to linear constraint solving. The type system is based on the potential method of amortized analysis and extends automatic amortized resource analysis (AARA) for deterministic programs. A main innovation is that bounds can contain symbolic probabilities, which may appear in data structures and function arguments. Another contribution is a novel soundness proof that establishes the correctness of the derived bounds with respect to a distribution-based operational cost semantics that also includes nontrivial diverging behavior. For cost models like time, derived bounds imply termination with probability one. To highlight the novel ideas, the presentation focuses on linear potential and a core language. However, the analysis is implemented as an extension of Resource Aware ML and supports polynomial bounds and user defined data structures. The effectiveness of the technique is evaluated by analyzing the sample complexity of discrete distributions and with a novel average-case estimation for deterministic programs that combines expected cost analysis with statistical methods.

Wed 26 Aug
Times are displayed in time zone: Eastern Time (US & Canada) change

14:30 - 16:25: New York 6ICFP Program at ICFP NY 6
Chair(s): Sukyoung RyuKAIST

Public livestreams: YouTube, Bilibili (China)

14:30 - 14:45
Talk
Compiling Effect Handlers in Capability-Passing Style
ICFP Program
Philipp SchusterUniversity of Tübingen, Germany, Jonathan Immanuel BrachthäuserUniversity of Tübingen, Germany, Klaus OstermannUniversity of Tübingen, Germany
DOI Media Attached
14:45 - 15:00
Talk
Scala Step-by-Step — Soundness for DOT with Step-Indexed Logical Relations in Iris
ICFP Program
Paolo G. GiarrussoBedRock Systems, Leo StefanescoIRIF, University Paris Diderot & CNRS, Amin TimanyAarhus University, Lars BirkedalAarhus University, Robbert KrebbersDelft University of Technology
DOI Media Attached
15:00 - 15:15
Talk
A dependently typed calculus with pattern matching and erasure inferenceDistinguished Paper
ICFP Program
Matúš TejiščákUniversity of St Andrews
DOI Media Attached
15:15 - 15:30
Talk
Raising Expectations: Automating Expected Cost Analysis with Types
ICFP Program
Di WangCarnegie Mellon University, David M. KahnCarnegie Mellon University, Jan HoffmannCarnegie Mellon University
DOI Media Attached
15:30 - 15:45
Talk
Program Sketching with Live Bidirectional Evaluation
ICFP Program
Justin LubinUniversity of Chicago, Nick CollinsUniversity of Chicago, Cyrus OmarUniversity of Michigan, Ravi ChughUniversity of Chicago
DOI Media Attached
15:45 - 16:00
Talk
Elaboration with First-Class Implicit Function Types
ICFP Program
András KovácsEötvös Loránd University
DOI Pre-print Media Attached
16:00 - 16:15
Talk
Kinds are Calling Conventions
ICFP Program
Paul DownenUniversity of Oregon, USA, Zena M. AriolaUniversity of Oregon, USA, Simon Peyton JonesMicrosoft, UK, Richard A. EisenbergTweag I/O
DOI Media Attached
16:15 - 16:25
Day closing
Conference closing
ICFP Program
Stephanie WeirichUniversity of Pennsylvania

Thu 27 Aug
Times are displayed in time zone: Eastern Time (US & Canada) change

02:30 - 04:25: Asia 6ICFP Program at ICFP Asia 6
Chair(s): Sukyoung RyuKAIST

Public livestreams: YouTube, Bilibili (China)

02:30 - 02:45
Talk
Compiling Effect Handlers in Capability-Passing Style
ICFP Program
Philipp SchusterUniversity of Tübingen, Germany, Jonathan Immanuel BrachthäuserUniversity of Tübingen, Germany, Klaus OstermannUniversity of Tübingen, Germany
DOI Media Attached
02:45 - 03:00
Talk
Scala Step-by-Step — Soundness for DOT with Step-Indexed Logical Relations in Iris
ICFP Program
Paolo G. GiarrussoBedRock Systems, Leo StefanescoIRIF, University Paris Diderot & CNRS, Amin TimanyAarhus University, Lars BirkedalAarhus University, Robbert KrebbersDelft University of Technology
DOI Media Attached
03:00 - 03:15
Talk
A dependently typed calculus with pattern matching and erasure inferenceDistinguished Paper
ICFP Program
Matúš TejiščákUniversity of St Andrews
DOI Media Attached
03:15 - 03:30
Talk
Raising Expectations: Automating Expected Cost Analysis with Types
ICFP Program
Di WangCarnegie Mellon University, David M. KahnCarnegie Mellon University, Jan HoffmannCarnegie Mellon University
DOI Media Attached
03:30 - 03:45
Talk
Program Sketching with Live Bidirectional Evaluation
ICFP Program
Justin LubinUniversity of Chicago, Nick CollinsUniversity of Chicago, Cyrus OmarUniversity of Michigan, Ravi ChughUniversity of Chicago
DOI Media Attached
03:45 - 04:00
Talk
Elaboration with First-Class Implicit Function Types
ICFP Program
András KovácsEötvös Loránd University
DOI Pre-print Media Attached
04:00 - 04:15
Talk
Kinds are Calling Conventions
ICFP Program
Paul DownenUniversity of Oregon, USA, Zena M. AriolaUniversity of Oregon, USA, Simon Peyton JonesMicrosoft, UK, Richard A. EisenbergTweag I/O
DOI Media Attached
04:15 - 04:25
Day closing
Conference closing
ICFP Program
Stephanie WeirichUniversity of Pennsylvania