Blogs (28) >>
ICFP 2017
Sun 3 - Sat 9 September 2017 Oxford, United Kingdom
Wed 6 Sep 2017 17:03 - 17:26 at L1 - Inference and Analysis Chair(s): Mark Jones

This paper introduces a new methodology for the complexity analysis
of higher-order functional programs, which is based on three
ingredients: a powerful type system for size analysis and a sound
type inference procedure for it, a ticking monadic transformation
and constraint solving. Noticeably, the presented methodology can be
fully automated, and is able to analyse a series of examples which
cannot be handled by most competitor methodologies. This is possible
due to various key ingredients, and in particular an abstract index
language and index polymorphism at higher ranks. A prototype
implementation is available.

Wed 6 Sep
Times are displayed in time zone: (GMT) Greenwich Mean Time : Belfast change

16:40 - 17:50: Inference and AnalysisResearch Papers at L1
Chair(s): Mark JonesPortland State University
16:40 - 17:03
Talk
Research Papers
J. Garrett MorrisUniversity of Kansas, USA, Richard A. EisenbergBryn Mawr College, USA
DOI
17:03 - 17:26
Talk
Research Papers
Martin AvanziniUniversity of Innsbruck, Austria, Ugo Dal LagoUniversity of Bologna, Italy / Inria, France
DOI
17:26 - 17:50
Talk
Research Papers
Justin PombrioBrown University, USA, Shriram KrishnamurthiBrown University, USA, Mitchell WandNortheastern University, USA
DOI