Seminars & Workshops

Strictness Meets Data Flow

Speaker:	Tom Schrijvers , Katholieke Universiteit Leuven, Belgium
When:	2010-04-15 15:00
Place:	Room 309, Bldg 302, SNU

Abstract

Properties of programs can be formulated using various techniques: dataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness analysis (establishing when function parameters are evaluated in a lazy language) as a dataflow analysis by expressing the dataflow properties as an effect system. Strictness properties so expressed give a clearer operational understanding and enable a range of additional optimisations including implicational strictness. At first order strictness effects have the expected principality properties (best-property inference) and can be computed simply. This is joint work with Alan Mycroft (Cambridge University, UK).

Short bio

Tom Schrijvers is a senior postdoctoral researcher of the Fund for Scientific Research Flanders affiliated to the Department of Computer Science, Katholieke Universiteit Leuven, Belgium. He received his Ph.D. in June 2005 with a thesis on "Analyses, Optimizations and Extensions of Constraint Handling Rules". His general area of interest is programming languages, and he has made research contributions to Functional, Logic and Constraint Programming on various topics (type inference, program analysis, optimized compilation, refactoring, etc).